/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:31:32,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:31:32,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:31:32,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:31:32,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:31:32,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:31:32,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:31:32,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:31:32,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:31:32,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:31:32,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:31:32,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:31:32,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:31:32,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:31:32,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:31:32,952 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:31:32,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:31:32,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:31:32,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:31:32,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:31:32,962 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:31:32,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:31:32,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:31:32,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:31:32,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:31:32,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:31:32,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:31:32,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:31:32,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:31:32,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:31:32,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:31:32,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:31:32,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:31:32,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:31:32,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:31:32,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:31:32,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:31:32,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:31:32,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:31:32,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:31:32,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:31:32,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:31:32,987 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:31:33,001 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:31:33,002 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:31:33,003 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:31:33,003 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:31:33,003 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:31:33,003 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:31:33,004 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:31:33,004 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:31:33,004 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:31:33,005 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:31:33,005 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:31:33,005 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:31:33,005 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:31:33,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:31:33,006 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:31:33,006 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:31:33,006 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:31:33,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:31:33,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:31:33,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:31:33,007 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:31:33,007 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:31:33,007 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:31:33,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:31:33,007 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:31:33,007 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:31:33,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:31:33,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:31:33,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:31:33,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:31:33,227 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:31:33,229 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c [2022-04-08 08:31:33,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3797233c3/4e0046076e1043cba853c8fb9a35f761/FLAGdfdf05328 [2022-04-08 08:31:33,726 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:31:33,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c [2022-04-08 08:31:33,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3797233c3/4e0046076e1043cba853c8fb9a35f761/FLAGdfdf05328 [2022-04-08 08:31:34,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3797233c3/4e0046076e1043cba853c8fb9a35f761 [2022-04-08 08:31:34,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:31:34,071 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:31:34,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:31:34,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:31:34,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:31:34,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@edceaa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34, skipping insertion in model container [2022-04-08 08:31:34,079 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:31:34,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:31:34,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c[65523,65536] [2022-04-08 08:31:34,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:31:34,554 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:31:34,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-1.c[65523,65536] [2022-04-08 08:31:34,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:31:34,689 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:31:34,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34 WrapperNode [2022-04-08 08:31:34,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:31:34,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:31:34,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:31:34,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:31:34,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,799 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:31:34,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:31:34,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:31:34,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:31:34,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34" (1/1) ... [2022-04-08 08:31:34,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:31:34,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:31:34,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:31:34,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:31:34,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:31:34,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:31:34,881 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:31:34,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-08 08:31:34,882 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-08 08:31:34,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:31:34,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-08 08:31:34,882 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 08:31:34,883 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 08:31:34,883 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 08:31:34,883 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:31:34,884 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:31:34,885 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:31:34,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 08:31:34,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:31:34,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 08:31:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 08:31:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 08:31:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 08:31:34,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:31:35,086 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:31:35,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:31:36,652 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 08:31:37,254 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-08 08:31:37,255 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-08 08:31:37,279 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:31:37,287 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:31:37,287 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:31:37,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:31:37 BoogieIcfgContainer [2022-04-08 08:31:37,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:31:37,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:31:37,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:31:37,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:31:37,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:31:34" (1/3) ... [2022-04-08 08:31:37,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1011319b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:31:37, skipping insertion in model container [2022-04-08 08:31:37,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:31:34" (2/3) ... [2022-04-08 08:31:37,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1011319b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:31:37, skipping insertion in model container [2022-04-08 08:31:37,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:31:37" (3/3) ... [2022-04-08 08:31:37,298 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-1.c [2022-04-08 08:31:37,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:31:37,304 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:31:37,349 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:31:37,361 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:31:37,362 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:31:37,393 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-08 08:31:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:31:37,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:37,404 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:31:37,405 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash -959596949, now seen corresponding path program 1 times [2022-04-08 08:31:37,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:37,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1072195103] [2022-04-08 08:31:37,428 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:31:37,429 INFO L85 PathProgramCache]: Analyzing trace with hash -959596949, now seen corresponding path program 2 times [2022-04-08 08:31:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:31:37,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21978641] [2022-04-08 08:31:37,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:31:37,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:31:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:31:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:38,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {150#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-08 08:31:38,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-08 08:31:38,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #592#return; {143#true} is VALID [2022-04-08 08:31:38,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {150#(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-08 08:31:38,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {150#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {143#true} is VALID [2022-04-08 08:31:38,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#true} assume true; {143#true} is VALID [2022-04-08 08:31:38,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {143#true} {143#true} #592#return; {143#true} is VALID [2022-04-08 08:31:38,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {143#true} call #t~ret159 := main(); {143#true} is VALID [2022-04-08 08:31:38,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {143#true} is VALID [2022-04-08 08:31:38,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {143#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {143#true} is VALID [2022-04-08 08:31:38,083 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~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:38,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} 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#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:38,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} 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#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:38,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:38,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {148#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:38,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {148#(= 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); {149#(= 12292 |ssl3_connect_#t~mem43|)} is VALID [2022-04-08 08:31:38,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {149#(= 12292 |ssl3_connect_#t~mem43|)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {144#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {144#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {144#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {144#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {144#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {144#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {144#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {144#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {144#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {144#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {144#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {144#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {144#false} is VALID [2022-04-08 08:31:38,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {144#false} assume 4432 == #t~mem56;havoc #t~mem56; {144#false} is VALID [2022-04-08 08:31:38,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {144#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {144#false} is VALID [2022-04-08 08:31:38,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {144#false} assume 5 == ~blastFlag~0; {144#false} is VALID [2022-04-08 08:31:38,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {144#false} assume !false; {144#false} is VALID [2022-04-08 08:31:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:31:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:31:38,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21978641] [2022-04-08 08:31:38,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21978641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:38,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:38,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:31:38,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:31:38,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1072195103] [2022-04-08 08:31:38,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1072195103] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:38,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:38,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:31:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473394001] [2022-04-08 08:31:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:31:38,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-08 08:31:38,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:31:38,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-08 08:31:38,151 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-08 08:31:38,151 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:31:38,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:31:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:31:38,185 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 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-08 08:31:40,241 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-08 08:31:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:41,536 INFO L93 Difference]: Finished difference Result 271 states and 444 transitions. [2022-04-08 08:31:41,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:31:41,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-08 08:31:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:31:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-08 08:31:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-08 08:31:41,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-08 08:31:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 444 transitions. [2022-04-08 08:31:41,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 444 transitions. [2022-04-08 08:31:41,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:41,962 INFO L225 Difference]: With dead ends: 271 [2022-04-08 08:31:41,962 INFO L226 Difference]: Without dead ends: 124 [2022-04-08 08:31:41,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:31:41,976 INFO L913 BasicCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:31:41,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 558 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:31:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-08 08:31:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-04-08 08:31:42,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:31:42,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:42,029 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:42,030 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:42,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:42,042 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-08 08:31:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-08 08:31:42,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:42,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:42,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 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 124 states. [2022-04-08 08:31:42,045 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 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 124 states. [2022-04-08 08:31:42,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:42,054 INFO L93 Difference]: Finished difference Result 124 states and 181 transitions. [2022-04-08 08:31:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2022-04-08 08:31:42,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:42,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:42,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:31:42,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:31:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2022-04-08 08:31:42,069 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 30 [2022-04-08 08:31:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:31:42,069 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2022-04-08 08:31:42,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-08 08:31:42,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 180 transitions. [2022-04-08 08:31:42,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2022-04-08 08:31:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 08:31:42,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:42,221 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:31:42,221 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:31:42,222 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:42,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash -541033565, now seen corresponding path program 1 times [2022-04-08 08:31:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:42,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1426137286] [2022-04-08 08:31:42,223 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:31:42,224 INFO L85 PathProgramCache]: Analyzing trace with hash -541033565, now seen corresponding path program 2 times [2022-04-08 08:31:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:31:42,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951786137] [2022-04-08 08:31:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:31:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:31:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:31:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:42,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {1197#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1191#true} is VALID [2022-04-08 08:31:42,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-08 08:31:42,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #592#return; {1191#true} is VALID [2022-04-08 08:31:42,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1197#(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-08 08:31:42,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {1197#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {1191#true} is VALID [2022-04-08 08:31:42,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-08 08:31:42,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #592#return; {1191#true} is VALID [2022-04-08 08:31:42,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret159 := main(); {1191#true} is VALID [2022-04-08 08:31:42,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1191#true} is VALID [2022-04-08 08:31:42,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {1191#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1191#true} is VALID [2022-04-08 08:31:42,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(= 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; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#(= 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; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {1196#(= 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)))); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {1196#(= 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); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem43;havoc #t~mem43; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} 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; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 36 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 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); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,509 INFO L290 TraceCheckUtils]: 21: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 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); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 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); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {1196#(= 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); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem56;havoc #t~mem56; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {1196#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 08:31:42,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {1196#(= ssl3_connect_~blastFlag~0 0)} assume 5 == ~blastFlag~0; {1192#false} is VALID [2022-04-08 08:31:42,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-08 08:31:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:31:42,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:31:42,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951786137] [2022-04-08 08:31:42,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951786137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:42,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:42,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:31:42,520 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:31:42,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1426137286] [2022-04-08 08:31:42,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1426137286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:42,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:42,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:31:42,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538588092] [2022-04-08 08:31:42,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:31:42,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 08:31:42,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:31:42,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:42,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:42,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:31:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:31:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:31:42,570 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:44,593 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-08 08:31:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:45,327 INFO L93 Difference]: Finished difference Result 333 states and 496 transitions. [2022-04-08 08:31:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:31:45,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-08 08:31:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:31:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-08 08:31:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-04-08 08:31:45,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-04-08 08:31:45,716 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-08 08:31:45,723 INFO L225 Difference]: With dead ends: 333 [2022-04-08 08:31:45,724 INFO L226 Difference]: Without dead ends: 226 [2022-04-08 08:31:45,725 INFO L912 BasicCegarLoop]: 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-08 08:31:45,725 INFO L913 BasicCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:31:45,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:31:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-08 08:31:45,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-04-08 08:31:45,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:31:45,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:45,742 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:45,743 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:45,752 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-08 08:31:45,752 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-08 08:31:45,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:45,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:45,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 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 226 states. [2022-04-08 08:31:45,755 INFO L87 Difference]: Start difference. First operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 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 226 states. [2022-04-08 08:31:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:45,764 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-04-08 08:31:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-08 08:31:45,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:45,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:45,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:31:45,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:31:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2022-04-08 08:31:45,774 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 45 [2022-04-08 08:31:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:31:45,774 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2022-04-08 08:31:45,775 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:45,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 330 transitions. [2022-04-08 08:31:46,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-04-08 08:31:46,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 08:31:46,036 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:46,039 INFO L499 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:31:46,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:31:46,040 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:46,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash -391559510, now seen corresponding path program 1 times [2022-04-08 08:31:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:46,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1179425283] [2022-04-08 08:31:46,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:31:46,042 INFO L85 PathProgramCache]: Analyzing trace with hash -391559510, now seen corresponding path program 2 times [2022-04-08 08:31:46,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:31:46,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691452637] [2022-04-08 08:31:46,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:31:46,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:31:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:31:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:31:46,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2770#true} is VALID [2022-04-08 08:31:46,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-08 08:31:46,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2770#true} {2770#true} #592#return; {2770#true} is VALID [2022-04-08 08:31:46,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {2770#true} call ULTIMATE.init(); {2777#(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-08 08:31:46,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {2770#true} is VALID [2022-04-08 08:31:46,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {2770#true} assume true; {2770#true} is VALID [2022-04-08 08:31:46,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2770#true} {2770#true} #592#return; {2770#true} is VALID [2022-04-08 08:31:46,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {2770#true} call #t~ret159 := main(); {2770#true} is VALID [2022-04-08 08:31:46,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {2770#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2770#true} is VALID [2022-04-08 08:31:46,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {2770#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2770#true} is VALID [2022-04-08 08:31:46,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {2770#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:46,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {2770#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; {2770#true} is VALID [2022-04-08 08:31:46,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {2770#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; {2770#true} is VALID [2022-04-08 08:31:46,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {2770#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2770#true} is VALID [2022-04-08 08:31:46,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-08 08:31:46,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {2770#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); {2770#true} is VALID [2022-04-08 08:31:46,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {2770#true} assume 12292 == #t~mem43;havoc #t~mem43; {2770#true} is VALID [2022-04-08 08:31:46,344 INFO L290 TraceCheckUtils]: 14: Hoare triple {2770#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; {2770#true} is VALID [2022-04-08 08:31:46,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {2770#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:46,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {2770#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {2770#true} is VALID [2022-04-08 08:31:46,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {2770#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:46,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {2770#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); {2770#true} is VALID [2022-04-08 08:31:46,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {2770#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {2770#true} is VALID [2022-04-08 08:31:46,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {2770#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {2770#true} is VALID [2022-04-08 08:31:46,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {2770#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {2770#true} is VALID [2022-04-08 08:31:46,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {2770#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); {2770#true} is VALID [2022-04-08 08:31:46,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {2770#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); {2770#true} is VALID [2022-04-08 08:31:46,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {2770#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {2770#true} is VALID [2022-04-08 08:31:46,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {2770#true} ~skip~0 := 0; {2770#true} is VALID [2022-04-08 08:31:46,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {2770#true} assume !false; {2770#true} is VALID [2022-04-08 08:31:46,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {2770#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); {2770#true} is VALID [2022-04-08 08:31:46,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {2770#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:46,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {2770#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:46,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {2770#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:46,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {2770#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:46,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {2770#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {2770#true} is VALID [2022-04-08 08:31:46,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {2770#true} assume 4368 == #t~mem48;havoc #t~mem48; {2770#true} is VALID [2022-04-08 08:31:46,352 INFO L290 TraceCheckUtils]: 34: Hoare triple {2770#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; {2770#true} is VALID [2022-04-08 08:31:46,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {2770#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2770#true} is VALID [2022-04-08 08:31:46,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {2770#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); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,368 INFO L290 TraceCheckUtils]: 37: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} 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; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,369 INFO L290 TraceCheckUtils]: 38: Hoare triple {2775#(= 4384 (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); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {2775#(= 4384 (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; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {2775#(= 4384 (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); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {2775#(= 4384 (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); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {2775#(= 4384 (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); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {2775#(= 4384 (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); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {2775#(= 4384 (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); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {2775#(= 4384 (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); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {2775#(= 4384 (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); {2775#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:31:46,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {2775#(= 4384 (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); {2776#(= |ssl3_connect_#t~mem50| 4384)} is VALID [2022-04-08 08:31:46,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {2776#(= |ssl3_connect_#t~mem50| 4384)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:46,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {2771#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:46,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {2771#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:46,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {2771#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:46,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {2771#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:46,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {2771#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {2771#false} is VALID [2022-04-08 08:31:46,377 INFO L290 TraceCheckUtils]: 56: Hoare triple {2771#false} assume 4432 == #t~mem56;havoc #t~mem56; {2771#false} is VALID [2022-04-08 08:31:46,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {2771#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {2771#false} is VALID [2022-04-08 08:31:46,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {2771#false} assume 5 == ~blastFlag~0; {2771#false} is VALID [2022-04-08 08:31:46,377 INFO L290 TraceCheckUtils]: 59: Hoare triple {2771#false} assume !false; {2771#false} is VALID [2022-04-08 08:31:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:31:46,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:31:46,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691452637] [2022-04-08 08:31:46,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691452637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:46,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:46,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:31:46,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:31:46,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1179425283] [2022-04-08 08:31:46,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1179425283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:31:46,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:31:46,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:31:46,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026322154] [2022-04-08 08:31:46,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:31:46,380 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 60 [2022-04-08 08:31:46,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:31:46,380 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-08 08:31:46,445 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-08 08:31:46,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:31:46,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:46,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:31:46,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:31:46,447 INFO L87 Difference]: Start difference. First operand 226 states and 330 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-08 08:31:48,475 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-08 08:31:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:49,678 INFO L93 Difference]: Finished difference Result 368 states and 543 transitions. [2022-04-08 08:31:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:31:49,678 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 60 [2022-04-08 08:31:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:31:49,679 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-08 08:31:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-08 08:31:49,684 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-08 08:31:49,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 390 transitions. [2022-04-08 08:31:49,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 390 transitions. [2022-04-08 08:31:49,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:49,979 INFO L225 Difference]: With dead ends: 368 [2022-04-08 08:31:49,979 INFO L226 Difference]: Without dead ends: 261 [2022-04-08 08:31:49,980 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:31:49,981 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:31:49,981 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:31:49,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-08 08:31:49,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 244. [2022-04-08 08:31:49,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:31:49,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:49,997 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:49,998 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:50,006 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-08 08:31:50,006 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-08 08:31:50,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:50,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:50,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 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 261 states. [2022-04-08 08:31:50,008 INFO L87 Difference]: Start difference. First operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 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 261 states. [2022-04-08 08:31:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:31:50,017 INFO L93 Difference]: Finished difference Result 261 states and 382 transitions. [2022-04-08 08:31:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 382 transitions. [2022-04-08 08:31:50,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:31:50,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:31:50,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:31:50,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:31:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 239 states have (on average 1.4895397489539748) internal successors, (356), 239 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:31:50,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 360 transitions. [2022-04-08 08:31:50,027 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 360 transitions. Word has length 60 [2022-04-08 08:31:50,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:31:50,027 INFO L478 AbstractCegarLoop]: Abstraction has 244 states and 360 transitions. [2022-04-08 08:31:50,027 INFO L479 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-08 08:31:50,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 244 states and 360 transitions. [2022-04-08 08:31:50,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:31:50,289 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 360 transitions. [2022-04-08 08:31:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 08:31:50,290 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:31:50,290 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 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] [2022-04-08 08:31:50,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:31:50,290 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:31:50,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:31:50,291 INFO L85 PathProgramCache]: Analyzing trace with hash -63404668, now seen corresponding path program 3 times [2022-04-08 08:31:50,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:31:50,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1228904976] [2022-04-08 08:32:01,859 WARN L232 SmtUtils]: Spent 11.56s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:32:11,291 WARN L232 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:32:12,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:32:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash -63404668, now seen corresponding path program 4 times [2022-04-08 08:32:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:32:12,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182045930] [2022-04-08 08:32:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:32:12,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:32:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:12,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:32:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:12,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {4535#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4528#true} is VALID [2022-04-08 08:32:12,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-08 08:32:12,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4528#true} {4528#true} #592#return; {4528#true} is VALID [2022-04-08 08:32:12,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {4528#true} call ULTIMATE.init(); {4535#(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-08 08:32:12,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {4528#true} is VALID [2022-04-08 08:32:12,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {4528#true} assume true; {4528#true} is VALID [2022-04-08 08:32:12,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4528#true} {4528#true} #592#return; {4528#true} is VALID [2022-04-08 08:32:12,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {4528#true} call #t~ret159 := main(); {4528#true} is VALID [2022-04-08 08:32:12,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {4528#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {4528#true} is VALID [2022-04-08 08:32:12,386 INFO L272 TraceCheckUtils]: 6: Hoare triple {4528#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {4528#true} is VALID [2022-04-08 08:32:12,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {4528#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:12,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {4528#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; {4528#true} is VALID [2022-04-08 08:32:12,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {4528#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; {4528#true} is VALID [2022-04-08 08:32:12,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {4528#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {4528#true} is VALID [2022-04-08 08:32:12,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-08 08:32:12,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {4528#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); {4528#true} is VALID [2022-04-08 08:32:12,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {4528#true} assume 12292 == #t~mem43;havoc #t~mem43; {4528#true} is VALID [2022-04-08 08:32:12,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {4528#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; {4528#true} is VALID [2022-04-08 08:32:12,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {4528#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:12,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {4528#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4528#true} is VALID [2022-04-08 08:32:12,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {4528#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:12,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {4528#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); {4528#true} is VALID [2022-04-08 08:32:12,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {4528#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {4528#true} is VALID [2022-04-08 08:32:12,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {4528#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4528#true} is VALID [2022-04-08 08:32:12,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {4528#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4528#true} is VALID [2022-04-08 08:32:12,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {4528#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); {4528#true} is VALID [2022-04-08 08:32:12,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {4528#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); {4528#true} is VALID [2022-04-08 08:32:12,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {4528#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4528#true} is VALID [2022-04-08 08:32:12,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {4528#true} ~skip~0 := 0; {4528#true} is VALID [2022-04-08 08:32:12,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {4528#true} assume !false; {4528#true} is VALID [2022-04-08 08:32:12,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {4528#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); {4528#true} is VALID [2022-04-08 08:32:12,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {4528#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:12,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {4528#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:12,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {4528#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:12,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {4528#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:12,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {4528#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4528#true} is VALID [2022-04-08 08:32:12,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {4528#true} assume 4368 == #t~mem48;havoc #t~mem48; {4528#true} is VALID [2022-04-08 08:32:12,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {4528#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; {4528#true} is VALID [2022-04-08 08:32:12,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {4528#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4528#true} is VALID [2022-04-08 08:32:12,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {4528#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); {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:12,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} 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; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:12,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {4533#(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); {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:12,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {4533#(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; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:12,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:12,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {4533#(not (= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:12,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {4533#(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); {4534#(not (= 12292 |ssl3_connect_#t~mem43|))} is VALID [2022-04-08 08:32:12,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {4534#(not (= 12292 |ssl3_connect_#t~mem43|))} assume 12292 == #t~mem43;havoc #t~mem43; {4529#false} is VALID [2022-04-08 08:32:12,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {4529#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; {4529#false} is VALID [2022-04-08 08:32:12,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {4529#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {4529#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {4529#false} is VALID [2022-04-08 08:32:12,396 INFO L290 TraceCheckUtils]: 47: Hoare triple {4529#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,396 INFO L290 TraceCheckUtils]: 48: Hoare triple {4529#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); {4529#false} is VALID [2022-04-08 08:32:12,396 INFO L290 TraceCheckUtils]: 49: Hoare triple {4529#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {4529#false} is VALID [2022-04-08 08:32:12,396 INFO L290 TraceCheckUtils]: 50: Hoare triple {4529#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {4529#false} is VALID [2022-04-08 08:32:12,396 INFO L290 TraceCheckUtils]: 51: Hoare triple {4529#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {4529#false} is VALID [2022-04-08 08:32:12,396 INFO L290 TraceCheckUtils]: 52: Hoare triple {4529#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); {4529#false} is VALID [2022-04-08 08:32:12,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {4529#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); {4529#false} is VALID [2022-04-08 08:32:12,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {4529#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {4529#false} is VALID [2022-04-08 08:32:12,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {4529#false} ~skip~0 := 0; {4529#false} is VALID [2022-04-08 08:32:12,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-08 08:32:12,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {4529#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); {4529#false} is VALID [2022-04-08 08:32:12,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {4529#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {4529#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,401 INFO L290 TraceCheckUtils]: 60: Hoare triple {4529#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,401 INFO L290 TraceCheckUtils]: 61: Hoare triple {4529#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {4529#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {4529#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,401 INFO L290 TraceCheckUtils]: 64: Hoare triple {4529#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {4529#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {4529#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,401 INFO L290 TraceCheckUtils]: 67: Hoare triple {4529#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {4529#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,402 INFO L290 TraceCheckUtils]: 69: Hoare triple {4529#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,402 INFO L290 TraceCheckUtils]: 70: Hoare triple {4529#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {4529#false} is VALID [2022-04-08 08:32:12,402 INFO L290 TraceCheckUtils]: 71: Hoare triple {4529#false} assume 4432 == #t~mem56;havoc #t~mem56; {4529#false} is VALID [2022-04-08 08:32:12,402 INFO L290 TraceCheckUtils]: 72: Hoare triple {4529#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {4529#false} is VALID [2022-04-08 08:32:12,402 INFO L290 TraceCheckUtils]: 73: Hoare triple {4529#false} assume 5 == ~blastFlag~0; {4529#false} is VALID [2022-04-08 08:32:12,402 INFO L290 TraceCheckUtils]: 74: Hoare triple {4529#false} assume !false; {4529#false} is VALID [2022-04-08 08:32:12,403 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:32:12,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:32:12,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182045930] [2022-04-08 08:32:12,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182045930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:12,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:12,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:32:12,406 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:32:12,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1228904976] [2022-04-08 08:32:12,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1228904976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:12,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:12,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:32:12,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657982263] [2022-04-08 08:32:12,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:32:12,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 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 75 [2022-04-08 08:32:12,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:32:12,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:12,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:12,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:32:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:12,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:32:12,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:32:12,480 INFO L87 Difference]: Start difference. First operand 244 states and 360 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:14,508 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-08 08:32:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:15,621 INFO L93 Difference]: Finished difference Result 655 states and 976 transitions. [2022-04-08 08:32:15,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:32:15,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 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 75 [2022-04-08 08:32:15,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:32:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:32:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:32:15,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-08 08:32:15,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:16,014 INFO L225 Difference]: With dead ends: 655 [2022-04-08 08:32:16,014 INFO L226 Difference]: Without dead ends: 427 [2022-04-08 08:32:16,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:32:16,018 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 113 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:32:16,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 302 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 381 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:32:16,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-08 08:32:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 266. [2022-04-08 08:32:16,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:32:16,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 427 states. Second operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:16,041 INFO L74 IsIncluded]: Start isIncluded. First operand 427 states. Second operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:16,042 INFO L87 Difference]: Start difference. First operand 427 states. Second operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:16,056 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-08 08:32:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-08 08:32:16,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:16,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:16,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 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 427 states. [2022-04-08 08:32:16,059 INFO L87 Difference]: Start difference. First operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 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 427 states. [2022-04-08 08:32:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:16,072 INFO L93 Difference]: Finished difference Result 427 states and 633 transitions. [2022-04-08 08:32:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 633 transitions. [2022-04-08 08:32:16,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:16,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:16,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:32:16,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:32:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 261 states have (on average 1.4827586206896552) internal successors, (387), 261 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 391 transitions. [2022-04-08 08:32:16,082 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 391 transitions. Word has length 75 [2022-04-08 08:32:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:32:16,082 INFO L478 AbstractCegarLoop]: Abstraction has 266 states and 391 transitions. [2022-04-08 08:32:16,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:16,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 266 states and 391 transitions. [2022-04-08 08:32:16,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 391 transitions. [2022-04-08 08:32:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-08 08:32:16,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:32:16,408 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2022-04-08 08:32:16,408 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:32:16,408 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:32:16,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:32:16,408 INFO L85 PathProgramCache]: Analyzing trace with hash -82060126, now seen corresponding path program 1 times [2022-04-08 08:32:16,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:16,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146897321] [2022-04-08 08:32:31,042 WARN L232 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:32:39,398 WARN L232 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:32:40,178 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:32:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash -82060126, now seen corresponding path program 2 times [2022-04-08 08:32:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:32:40,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629507421] [2022-04-08 08:32:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:32:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:32:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:40,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:32:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:32:40,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {7243#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7236#true} is VALID [2022-04-08 08:32:40,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-08 08:32:40,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7236#true} {7236#true} #592#return; {7236#true} is VALID [2022-04-08 08:32:40,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {7236#true} call ULTIMATE.init(); {7243#(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-08 08:32:40,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {7243#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {7236#true} is VALID [2022-04-08 08:32:40,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {7236#true} assume true; {7236#true} is VALID [2022-04-08 08:32:40,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7236#true} {7236#true} #592#return; {7236#true} is VALID [2022-04-08 08:32:40,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {7236#true} call #t~ret159 := main(); {7236#true} is VALID [2022-04-08 08:32:40,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {7236#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {7236#true} is VALID [2022-04-08 08:32:40,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {7236#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {7236#true} is VALID [2022-04-08 08:32:40,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {7236#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:40,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {7236#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; {7236#true} is VALID [2022-04-08 08:32:40,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {7236#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; {7236#true} is VALID [2022-04-08 08:32:40,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {7236#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {7236#true} is VALID [2022-04-08 08:32:40,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-08 08:32:40,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {7236#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); {7236#true} is VALID [2022-04-08 08:32:40,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {7236#true} assume 12292 == #t~mem43;havoc #t~mem43; {7236#true} is VALID [2022-04-08 08:32:40,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {7236#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; {7236#true} is VALID [2022-04-08 08:32:40,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {7236#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:40,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {7236#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7236#true} is VALID [2022-04-08 08:32:40,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {7236#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:40,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {7236#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); {7236#true} is VALID [2022-04-08 08:32:40,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {7236#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {7236#true} is VALID [2022-04-08 08:32:40,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {7236#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7236#true} is VALID [2022-04-08 08:32:40,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {7236#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7236#true} is VALID [2022-04-08 08:32:40,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {7236#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); {7236#true} is VALID [2022-04-08 08:32:40,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {7236#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); {7236#true} is VALID [2022-04-08 08:32:40,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {7236#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7236#true} is VALID [2022-04-08 08:32:40,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {7236#true} ~skip~0 := 0; {7236#true} is VALID [2022-04-08 08:32:40,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {7236#true} assume !false; {7236#true} is VALID [2022-04-08 08:32:40,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {7236#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); {7236#true} is VALID [2022-04-08 08:32:40,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {7236#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:40,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {7236#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:40,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {7236#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:40,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {7236#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:40,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {7236#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7236#true} is VALID [2022-04-08 08:32:40,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {7236#true} assume 4368 == #t~mem48;havoc #t~mem48; {7236#true} is VALID [2022-04-08 08:32:40,431 INFO L290 TraceCheckUtils]: 34: Hoare triple {7236#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; {7236#true} is VALID [2022-04-08 08:32:40,431 INFO L290 TraceCheckUtils]: 35: Hoare triple {7236#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7236#true} is VALID [2022-04-08 08:32:40,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {7236#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); {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:40,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} 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; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:40,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {7241#(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); {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:40,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {7241#(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; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:40,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:40,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:40,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {7241#(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); {7241#(not (= 16384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:32:40,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {7241#(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); {7242#(not (= |ssl3_connect_#t~mem44| 16384))} is VALID [2022-04-08 08:32:40,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {7242#(not (= |ssl3_connect_#t~mem44| 16384))} assume 16384 == #t~mem44;havoc #t~mem44; {7237#false} is VALID [2022-04-08 08:32:40,437 INFO L290 TraceCheckUtils]: 45: Hoare triple {7237#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {7237#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {7237#false} is VALID [2022-04-08 08:32:40,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {7237#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {7237#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); {7237#false} is VALID [2022-04-08 08:32:40,438 INFO L290 TraceCheckUtils]: 49: Hoare triple {7237#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {7237#false} is VALID [2022-04-08 08:32:40,438 INFO L290 TraceCheckUtils]: 50: Hoare triple {7237#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {7237#false} is VALID [2022-04-08 08:32:40,438 INFO L290 TraceCheckUtils]: 51: Hoare triple {7237#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {7237#false} is VALID [2022-04-08 08:32:40,439 INFO L290 TraceCheckUtils]: 52: Hoare triple {7237#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); {7237#false} is VALID [2022-04-08 08:32:40,439 INFO L290 TraceCheckUtils]: 53: Hoare triple {7237#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); {7237#false} is VALID [2022-04-08 08:32:40,439 INFO L290 TraceCheckUtils]: 54: Hoare triple {7237#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {7237#false} is VALID [2022-04-08 08:32:40,439 INFO L290 TraceCheckUtils]: 55: Hoare triple {7237#false} ~skip~0 := 0; {7237#false} is VALID [2022-04-08 08:32:40,439 INFO L290 TraceCheckUtils]: 56: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-08 08:32:40,439 INFO L290 TraceCheckUtils]: 57: Hoare triple {7237#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); {7237#false} is VALID [2022-04-08 08:32:40,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {7237#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {7237#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 60: Hoare triple {7237#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {7237#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 62: Hoare triple {7237#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 63: Hoare triple {7237#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {7237#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {7237#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 66: Hoare triple {7237#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 67: Hoare triple {7237#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 68: Hoare triple {7237#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 69: Hoare triple {7237#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {7237#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {7237#false} is VALID [2022-04-08 08:32:40,441 INFO L290 TraceCheckUtils]: 71: Hoare triple {7237#false} assume 4432 == #t~mem56;havoc #t~mem56; {7237#false} is VALID [2022-04-08 08:32:40,441 INFO L290 TraceCheckUtils]: 72: Hoare triple {7237#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {7237#false} is VALID [2022-04-08 08:32:40,441 INFO L290 TraceCheckUtils]: 73: Hoare triple {7237#false} assume 5 == ~blastFlag~0; {7237#false} is VALID [2022-04-08 08:32:40,441 INFO L290 TraceCheckUtils]: 74: Hoare triple {7237#false} assume !false; {7237#false} is VALID [2022-04-08 08:32:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:32:40,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:32:40,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629507421] [2022-04-08 08:32:40,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629507421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:40,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:40,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:32:40,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:32:40,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146897321] [2022-04-08 08:32:40,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146897321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:32:40,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:32:40,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:32:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553172988] [2022-04-08 08:32:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:32:40,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 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 75 [2022-04-08 08:32:40,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:32:40,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:40,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:40,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:32:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:40,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:32:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:32:40,511 INFO L87 Difference]: Start difference. First operand 266 states and 391 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:42,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:32:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:43,592 INFO L93 Difference]: Finished difference Result 678 states and 1005 transitions. [2022-04-08 08:32:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:32:43,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 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 75 [2022-04-08 08:32:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:32:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 08:32:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 08:32:43,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-08 08:32:44,005 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-08 08:32:44,018 INFO L225 Difference]: With dead ends: 678 [2022-04-08 08:32:44,018 INFO L226 Difference]: Without dead ends: 428 [2022-04-08 08:32:44,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:32:44,027 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 120 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:32:44,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:32:44,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-08 08:32:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 268. [2022-04-08 08:32:44,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:32:44,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:44,055 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:44,067 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:44,080 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-08 08:32:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-08 08:32:44,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:44,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:44,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 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 428 states. [2022-04-08 08:32:44,083 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 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 428 states. [2022-04-08 08:32:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:32:44,096 INFO L93 Difference]: Finished difference Result 428 states and 631 transitions. [2022-04-08 08:32:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 631 transitions. [2022-04-08 08:32:44,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:32:44,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:32:44,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:32:44,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:32:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4752851711026616) internal successors, (388), 263 states have internal predecessors, (388), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 392 transitions. [2022-04-08 08:32:44,105 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 392 transitions. Word has length 75 [2022-04-08 08:32:44,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:32:44,105 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 392 transitions. [2022-04-08 08:32:44,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:32:44,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 392 transitions. [2022-04-08 08:32:44,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:32:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 392 transitions. [2022-04-08 08:32:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-08 08:32:44,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:32:44,418 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:32:44,418 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:32:44,418 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:32:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:32:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2070296643, now seen corresponding path program 1 times [2022-04-08 08:32:44,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:32:44,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2073920456] [2022-04-08 08:33:00,489 WARN L232 SmtUtils]: Spent 10.34s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:33:09,570 WARN L232 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:33:10,387 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:33:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash -2070296643, now seen corresponding path program 2 times [2022-04-08 08:33:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:33:10,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848218151] [2022-04-08 08:33:10,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:33:10,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:33:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:10,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:33:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:10,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {10003#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9996#true} is VALID [2022-04-08 08:33:10,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-08 08:33:10,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9996#true} {9996#true} #592#return; {9996#true} is VALID [2022-04-08 08:33:10,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {9996#true} call ULTIMATE.init(); {10003#(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-08 08:33:10,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {10003#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {9996#true} is VALID [2022-04-08 08:33:10,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {9996#true} assume true; {9996#true} is VALID [2022-04-08 08:33:10,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9996#true} {9996#true} #592#return; {9996#true} is VALID [2022-04-08 08:33:10,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {9996#true} call #t~ret159 := main(); {9996#true} is VALID [2022-04-08 08:33:10,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {9996#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {9996#true} is VALID [2022-04-08 08:33:10,619 INFO L272 TraceCheckUtils]: 6: Hoare triple {9996#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {9996#true} is VALID [2022-04-08 08:33:10,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {9996#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:10,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {9996#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; {9996#true} is VALID [2022-04-08 08:33:10,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {9996#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; {9996#true} is VALID [2022-04-08 08:33:10,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {9996#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {9996#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); {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {9996#true} assume 12292 == #t~mem43;havoc #t~mem43; {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {9996#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; {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {9996#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {9996#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {9996#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {9996#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); {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {9996#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {9996#true} is VALID [2022-04-08 08:33:10,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {9996#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {9996#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {9996#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); {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {9996#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); {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {9996#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {9996#true} ~skip~0 := 0; {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {9996#true} assume !false; {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {9996#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); {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {9996#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {9996#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {9996#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:10,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {9996#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:10,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {9996#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9996#true} is VALID [2022-04-08 08:33:10,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {9996#true} assume 4368 == #t~mem48;havoc #t~mem48; {9996#true} is VALID [2022-04-08 08:33:10,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {9996#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; {9996#true} is VALID [2022-04-08 08:33:10,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {9996#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {9996#true} is VALID [2022-04-08 08:33:10,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {9996#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); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:10,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} 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; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:10,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {10001#(= 4384 (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); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:10,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {10001#(= 4384 (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; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:10,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:10,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:10,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {10001#(= 4384 (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); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:10,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {10001#(= 4384 (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); {10001#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:10,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {10001#(= 4384 (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); {10002#(= |ssl3_connect_#t~mem45| 4384)} is VALID [2022-04-08 08:33:10,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {10002#(= |ssl3_connect_#t~mem45| 4384)} assume 4096 == #t~mem45;havoc #t~mem45; {9997#false} is VALID [2022-04-08 08:33:10,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {9997#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {9997#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {9997#false} is VALID [2022-04-08 08:33:10,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {9997#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {9997#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); {9997#false} is VALID [2022-04-08 08:33:10,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {9997#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {9997#false} is VALID [2022-04-08 08:33:10,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {9997#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {9997#false} is VALID [2022-04-08 08:33:10,633 INFO L290 TraceCheckUtils]: 52: Hoare triple {9997#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {9997#false} is VALID [2022-04-08 08:33:10,633 INFO L290 TraceCheckUtils]: 53: Hoare triple {9997#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); {9997#false} is VALID [2022-04-08 08:33:10,633 INFO L290 TraceCheckUtils]: 54: Hoare triple {9997#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); {9997#false} is VALID [2022-04-08 08:33:10,633 INFO L290 TraceCheckUtils]: 55: Hoare triple {9997#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {9997#false} is VALID [2022-04-08 08:33:10,634 INFO L290 TraceCheckUtils]: 56: Hoare triple {9997#false} ~skip~0 := 0; {9997#false} is VALID [2022-04-08 08:33:10,634 INFO L290 TraceCheckUtils]: 57: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-08 08:33:10,634 INFO L290 TraceCheckUtils]: 58: Hoare triple {9997#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); {9997#false} is VALID [2022-04-08 08:33:10,634 INFO L290 TraceCheckUtils]: 59: Hoare triple {9997#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,634 INFO L290 TraceCheckUtils]: 60: Hoare triple {9997#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,634 INFO L290 TraceCheckUtils]: 61: Hoare triple {9997#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,634 INFO L290 TraceCheckUtils]: 62: Hoare triple {9997#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,634 INFO L290 TraceCheckUtils]: 63: Hoare triple {9997#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,635 INFO L290 TraceCheckUtils]: 64: Hoare triple {9997#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,635 INFO L290 TraceCheckUtils]: 65: Hoare triple {9997#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,635 INFO L290 TraceCheckUtils]: 66: Hoare triple {9997#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,635 INFO L290 TraceCheckUtils]: 67: Hoare triple {9997#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,635 INFO L290 TraceCheckUtils]: 68: Hoare triple {9997#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,635 INFO L290 TraceCheckUtils]: 69: Hoare triple {9997#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,637 INFO L290 TraceCheckUtils]: 70: Hoare triple {9997#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,638 INFO L290 TraceCheckUtils]: 71: Hoare triple {9997#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {9997#false} is VALID [2022-04-08 08:33:10,639 INFO L290 TraceCheckUtils]: 72: Hoare triple {9997#false} assume 4432 == #t~mem56;havoc #t~mem56; {9997#false} is VALID [2022-04-08 08:33:10,639 INFO L290 TraceCheckUtils]: 73: Hoare triple {9997#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {9997#false} is VALID [2022-04-08 08:33:10,640 INFO L290 TraceCheckUtils]: 74: Hoare triple {9997#false} assume 5 == ~blastFlag~0; {9997#false} is VALID [2022-04-08 08:33:10,640 INFO L290 TraceCheckUtils]: 75: Hoare triple {9997#false} assume !false; {9997#false} is VALID [2022-04-08 08:33:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:33:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:33:10,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848218151] [2022-04-08 08:33:10,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848218151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:10,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:10,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:33:10,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:33:10,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2073920456] [2022-04-08 08:33:10,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2073920456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:10,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:10,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:33:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245013591] [2022-04-08 08:33:10,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:33:10,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 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 76 [2022-04-08 08:33:10,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:33:10,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:10,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:10,709 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:33:10,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:33:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:33:10,710 INFO L87 Difference]: Start difference. First operand 268 states and 392 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:12,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:33:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:13,824 INFO L93 Difference]: Finished difference Result 421 states and 618 transitions. [2022-04-08 08:33:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:33:13,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 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 76 [2022-04-08 08:33:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:33:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:13,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-08 08:33:13,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 386 transitions. [2022-04-08 08:33:13,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 386 transitions. [2022-04-08 08:33:14,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 386 edges. 386 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:14,160 INFO L225 Difference]: With dead ends: 421 [2022-04-08 08:33:14,160 INFO L226 Difference]: Without dead ends: 284 [2022-04-08 08:33:14,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:33:14,161 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:33:14,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:33:14,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-08 08:33:14,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-08 08:33:14,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:33:14,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:14,177 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:14,178 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:14,184 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-08 08:33:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-08 08:33:14,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:14,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:14,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 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 284 states. [2022-04-08 08:33:14,186 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 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 284 states. [2022-04-08 08:33:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:14,193 INFO L93 Difference]: Finished difference Result 284 states and 412 transitions. [2022-04-08 08:33:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 412 transitions. [2022-04-08 08:33:14,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:14,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:14,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:33:14,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:33:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4714828897338403) internal successors, (387), 263 states have internal predecessors, (387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 391 transitions. [2022-04-08 08:33:14,201 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 391 transitions. Word has length 76 [2022-04-08 08:33:14,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:33:14,202 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 391 transitions. [2022-04-08 08:33:14,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:14,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 391 transitions. [2022-04-08 08:33:14,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 391 transitions. [2022-04-08 08:33:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 08:33:14,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:33:14,536 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:33:14,537 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:33:14,537 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:33:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:33:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1822086841, now seen corresponding path program 1 times [2022-04-08 08:33:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:14,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [258102841] [2022-04-08 08:33:31,801 WARN L232 SmtUtils]: Spent 11.61s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:33:43,047 WARN L232 SmtUtils]: Spent 7.35s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:33:43,811 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:33:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1822086841, now seen corresponding path program 2 times [2022-04-08 08:33:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:33:43,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753792247] [2022-04-08 08:33:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:33:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:33:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:33:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:33:43,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {11961#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11954#true} is VALID [2022-04-08 08:33:43,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-08 08:33:43,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11954#true} {11954#true} #592#return; {11954#true} is VALID [2022-04-08 08:33:43,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {11954#true} call ULTIMATE.init(); {11961#(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-08 08:33:44,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {11961#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {11954#true} is VALID [2022-04-08 08:33:44,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {11954#true} assume true; {11954#true} is VALID [2022-04-08 08:33:44,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11954#true} {11954#true} #592#return; {11954#true} is VALID [2022-04-08 08:33:44,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {11954#true} call #t~ret159 := main(); {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {11954#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L272 TraceCheckUtils]: 6: Hoare triple {11954#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {11954#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {11954#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; {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {11954#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; {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {11954#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {11954#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); {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {11954#true} assume 12292 == #t~mem43;havoc #t~mem43; {11954#true} is VALID [2022-04-08 08:33:44,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {11954#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; {11954#true} is VALID [2022-04-08 08:33:44,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {11954#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:44,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {11954#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11954#true} is VALID [2022-04-08 08:33:44,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {11954#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:44,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {11954#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); {11954#true} is VALID [2022-04-08 08:33:44,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {11954#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {11954#true} is VALID [2022-04-08 08:33:44,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {11954#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11954#true} is VALID [2022-04-08 08:33:44,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {11954#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11954#true} is VALID [2022-04-08 08:33:44,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {11954#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); {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {11954#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); {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {11954#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {11954#true} ~skip~0 := 0; {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {11954#true} assume !false; {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {11954#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); {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {11954#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 29: Hoare triple {11954#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 30: Hoare triple {11954#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 31: Hoare triple {11954#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:44,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {11954#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11954#true} is VALID [2022-04-08 08:33:44,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {11954#true} assume 4368 == #t~mem48;havoc #t~mem48; {11954#true} is VALID [2022-04-08 08:33:44,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {11954#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; {11954#true} is VALID [2022-04-08 08:33:44,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {11954#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11954#true} is VALID [2022-04-08 08:33:44,006 INFO L290 TraceCheckUtils]: 36: Hoare triple {11954#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); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:44,006 INFO L290 TraceCheckUtils]: 37: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} 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; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:44,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {11959#(= 4384 (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); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:44,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {11959#(= 4384 (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; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:44,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:44,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:44,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {11959#(= 4384 (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); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:44,008 INFO L290 TraceCheckUtils]: 43: Hoare triple {11959#(= 4384 (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); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:44,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {11959#(= 4384 (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); {11959#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:33:44,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {11959#(= 4384 (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); {11960#(= |ssl3_connect_#t~mem46| 4384)} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 46: Hoare triple {11960#(= |ssl3_connect_#t~mem46| 4384)} assume 20480 == #t~mem46;havoc #t~mem46; {11955#false} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {11955#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {11955#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {11955#false} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 49: Hoare triple {11955#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 50: Hoare triple {11955#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); {11955#false} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 51: Hoare triple {11955#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {11955#false} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 52: Hoare triple {11955#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {11955#false} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 53: Hoare triple {11955#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {11955#false} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 54: Hoare triple {11955#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); {11955#false} is VALID [2022-04-08 08:33:44,010 INFO L290 TraceCheckUtils]: 55: Hoare triple {11955#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); {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 56: Hoare triple {11955#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 57: Hoare triple {11955#false} ~skip~0 := 0; {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 58: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 59: Hoare triple {11955#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); {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 60: Hoare triple {11955#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 61: Hoare triple {11955#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 62: Hoare triple {11955#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 63: Hoare triple {11955#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 64: Hoare triple {11955#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 65: Hoare triple {11955#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,011 INFO L290 TraceCheckUtils]: 66: Hoare triple {11955#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 67: Hoare triple {11955#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 68: Hoare triple {11955#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 69: Hoare triple {11955#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {11955#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {11955#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 72: Hoare triple {11955#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 73: Hoare triple {11955#false} assume 4432 == #t~mem56;havoc #t~mem56; {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 74: Hoare triple {11955#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 75: Hoare triple {11955#false} assume 5 == ~blastFlag~0; {11955#false} is VALID [2022-04-08 08:33:44,012 INFO L290 TraceCheckUtils]: 76: Hoare triple {11955#false} assume !false; {11955#false} is VALID [2022-04-08 08:33:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:33:44,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:33:44,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753792247] [2022-04-08 08:33:44,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753792247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:44,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:44,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:33:44,014 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:33:44,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [258102841] [2022-04-08 08:33:44,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [258102841] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:33:44,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:33:44,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:33:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007433587] [2022-04-08 08:33:44,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:33:44,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 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 77 [2022-04-08 08:33:44,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:33:44,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:44,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:44,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:33:44,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:44,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:33:44,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:33:44,083 INFO L87 Difference]: Start difference. First operand 268 states and 391 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:46,109 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-08 08:33:47,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:47,133 INFO L93 Difference]: Finished difference Result 421 states and 616 transitions. [2022-04-08 08:33:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:33:47,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 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 77 [2022-04-08 08:33:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:33:47,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-08 08:33:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2022-04-08 08:33:47,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 385 transitions. [2022-04-08 08:33:47,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 385 edges. 385 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:47,468 INFO L225 Difference]: With dead ends: 421 [2022-04-08 08:33:47,468 INFO L226 Difference]: Without dead ends: 284 [2022-04-08 08:33:47,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:33:47,469 INFO L913 BasicCegarLoop]: 197 mSDtfsCounter, 31 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:33:47,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 484 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:33:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-04-08 08:33:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 268. [2022-04-08 08:33:47,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:33:47,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:47,482 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:47,483 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:47,489 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-08 08:33:47,489 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-08 08:33:47,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:47,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:47,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 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 284 states. [2022-04-08 08:33:47,491 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 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 284 states. [2022-04-08 08:33:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:33:47,497 INFO L93 Difference]: Finished difference Result 284 states and 411 transitions. [2022-04-08 08:33:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 411 transitions. [2022-04-08 08:33:47,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:33:47,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:33:47,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:33:47,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:33:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.467680608365019) internal successors, (386), 263 states have internal predecessors, (386), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 390 transitions. [2022-04-08 08:33:47,505 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 390 transitions. Word has length 77 [2022-04-08 08:33:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:33:47,506 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 390 transitions. [2022-04-08 08:33:47,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:33:47,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 390 transitions. [2022-04-08 08:33:47,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:33:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2022-04-08 08:33:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 08:33:47,878 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:33:47,878 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 08:33:47,878 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:33:47,878 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:33:47,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:33:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash -963517886, now seen corresponding path program 1 times [2022-04-08 08:33:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:33:47,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1792889891] [2022-04-08 08:34:11,989 WARN L232 SmtUtils]: Spent 18.53s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:34:22,870 WARN L232 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:34:23,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash -963517886, now seen corresponding path program 2 times [2022-04-08 08:34:23,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:23,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031068252] [2022-04-08 08:34:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:23,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:23,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {13919#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13912#true} is VALID [2022-04-08 08:34:23,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-08 08:34:23,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13912#true} {13912#true} #592#return; {13912#true} is VALID [2022-04-08 08:34:23,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {13912#true} call ULTIMATE.init(); {13919#(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-08 08:34:23,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {13919#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {13912#true} is VALID [2022-04-08 08:34:23,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {13912#true} assume true; {13912#true} is VALID [2022-04-08 08:34:23,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13912#true} {13912#true} #592#return; {13912#true} is VALID [2022-04-08 08:34:23,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {13912#true} call #t~ret159 := main(); {13912#true} is VALID [2022-04-08 08:34:23,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {13912#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {13912#true} is VALID [2022-04-08 08:34:23,954 INFO L272 TraceCheckUtils]: 6: Hoare triple {13912#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {13912#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {13912#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; {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {13912#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; {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {13912#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {13912#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); {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {13912#true} assume 12292 == #t~mem43;havoc #t~mem43; {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {13912#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; {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {13912#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {13912#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {13912#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:23,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {13912#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); {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {13912#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {13912#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {13912#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {13912#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); {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {13912#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); {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {13912#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {13912#true} ~skip~0 := 0; {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {13912#true} assume !false; {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {13912#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); {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {13912#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {13912#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {13912#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:23,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {13912#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:23,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {13912#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13912#true} is VALID [2022-04-08 08:34:23,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {13912#true} assume 4368 == #t~mem48;havoc #t~mem48; {13912#true} is VALID [2022-04-08 08:34:23,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {13912#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; {13912#true} is VALID [2022-04-08 08:34:23,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {13912#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {13912#true} is VALID [2022-04-08 08:34:23,958 INFO L290 TraceCheckUtils]: 36: Hoare triple {13912#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); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} 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; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {13917#(= 4384 (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); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {13917#(= 4384 (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; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {13917#(= 4384 (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); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {13917#(= 4384 (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); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,962 INFO L290 TraceCheckUtils]: 44: Hoare triple {13917#(= 4384 (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); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {13917#(= 4384 (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); {13917#(= 4384 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:23,962 INFO L290 TraceCheckUtils]: 46: Hoare triple {13917#(= 4384 (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); {13918#(= |ssl3_connect_#t~mem47| 4384)} is VALID [2022-04-08 08:34:23,963 INFO L290 TraceCheckUtils]: 47: Hoare triple {13918#(= |ssl3_connect_#t~mem47| 4384)} assume 4099 == #t~mem47;havoc #t~mem47; {13913#false} is VALID [2022-04-08 08:34:23,963 INFO L290 TraceCheckUtils]: 48: Hoare triple {13913#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,963 INFO L290 TraceCheckUtils]: 49: Hoare triple {13913#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {13913#false} is VALID [2022-04-08 08:34:23,963 INFO L290 TraceCheckUtils]: 50: Hoare triple {13913#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,963 INFO L290 TraceCheckUtils]: 51: Hoare triple {13913#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); {13913#false} is VALID [2022-04-08 08:34:23,963 INFO L290 TraceCheckUtils]: 52: Hoare triple {13913#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {13913#false} is VALID [2022-04-08 08:34:23,963 INFO L290 TraceCheckUtils]: 53: Hoare triple {13913#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {13913#false} is VALID [2022-04-08 08:34:23,963 INFO L290 TraceCheckUtils]: 54: Hoare triple {13913#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {13913#false} is VALID [2022-04-08 08:34:23,963 INFO L290 TraceCheckUtils]: 55: Hoare triple {13913#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); {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 56: Hoare triple {13913#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); {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 57: Hoare triple {13913#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {13913#false} ~skip~0 := 0; {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 60: Hoare triple {13913#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); {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {13913#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {13913#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 63: Hoare triple {13913#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 64: Hoare triple {13913#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 65: Hoare triple {13913#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 66: Hoare triple {13913#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,964 INFO L290 TraceCheckUtils]: 67: Hoare triple {13913#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 68: Hoare triple {13913#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 69: Hoare triple {13913#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 70: Hoare triple {13913#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 71: Hoare triple {13913#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 72: Hoare triple {13913#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 73: Hoare triple {13913#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 74: Hoare triple {13913#false} assume 4432 == #t~mem56;havoc #t~mem56; {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 75: Hoare triple {13913#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 76: Hoare triple {13913#false} assume 5 == ~blastFlag~0; {13913#false} is VALID [2022-04-08 08:34:23,965 INFO L290 TraceCheckUtils]: 77: Hoare triple {13913#false} assume !false; {13913#false} is VALID [2022-04-08 08:34:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:34:23,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:23,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031068252] [2022-04-08 08:34:23,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031068252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:23,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:23,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:23,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:23,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1792889891] [2022-04-08 08:34:23,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1792889891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:23,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:23,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943744943] [2022-04-08 08:34:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:23,967 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 78 [2022-04-08 08:34:23,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:23,968 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-08 08:34:24,040 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-08 08:34:24,040 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:34:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:34:24,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:34:24,041 INFO L87 Difference]: Start difference. First operand 268 states and 390 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-08 08:34:26,070 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-08 08:34:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:26,959 INFO L93 Difference]: Finished difference Result 412 states and 603 transitions. [2022-04-08 08:34:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:34:26,960 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 78 [2022-04-08 08:34:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:26,960 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-08 08:34:26,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-08 08:34:26,963 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-08 08:34:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 373 transitions. [2022-04-08 08:34:26,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 373 transitions. [2022-04-08 08:34:27,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 373 edges. 373 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:27,282 INFO L225 Difference]: With dead ends: 412 [2022-04-08 08:34:27,282 INFO L226 Difference]: Without dead ends: 275 [2022-04-08 08:34:27,283 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:34:27,283 INFO L913 BasicCegarLoop]: 190 mSDtfsCounter, 22 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:27,283 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 470 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-08 08:34:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 268. [2022-04-08 08:34:27,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:27,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:27,304 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:27,306 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:27,312 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-08 08:34:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-08 08:34:27,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:27,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:27,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 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 275 states. [2022-04-08 08:34:27,315 INFO L87 Difference]: Start difference. First operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 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 275 states. [2022-04-08 08:34:27,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:27,322 INFO L93 Difference]: Finished difference Result 275 states and 399 transitions. [2022-04-08 08:34:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 399 transitions. [2022-04-08 08:34:27,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:27,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:27,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:27,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 263 states have (on average 1.4638783269961977) internal successors, (385), 263 states have internal predecessors, (385), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 389 transitions. [2022-04-08 08:34:27,330 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 389 transitions. Word has length 78 [2022-04-08 08:34:27,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:27,330 INFO L478 AbstractCegarLoop]: Abstraction has 268 states and 389 transitions. [2022-04-08 08:34:27,331 INFO L479 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-08 08:34:27,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 268 states and 389 transitions. [2022-04-08 08:34:27,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:27,685 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 389 transitions. [2022-04-08 08:34:27,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 08:34:27,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:27,686 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 08:34:27,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:34:27,687 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:27,687 INFO L85 PathProgramCache]: Analyzing trace with hash -867420063, now seen corresponding path program 1 times [2022-04-08 08:34:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:27,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1686239435] [2022-04-08 08:34:27,688 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash -867420063, now seen corresponding path program 2 times [2022-04-08 08:34:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:27,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621440705] [2022-04-08 08:34:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:27,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:27,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {15840#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15834#true} is VALID [2022-04-08 08:34:27,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-08 08:34:27,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15834#true} {15834#true} #592#return; {15834#true} is VALID [2022-04-08 08:34:27,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {15834#true} call ULTIMATE.init(); {15840#(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-08 08:34:27,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {15840#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {15834#true} is VALID [2022-04-08 08:34:27,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {15834#true} assume true; {15834#true} is VALID [2022-04-08 08:34:27,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15834#true} {15834#true} #592#return; {15834#true} is VALID [2022-04-08 08:34:27,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {15834#true} call #t~ret159 := main(); {15834#true} is VALID [2022-04-08 08:34:27,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {15834#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {15834#true} is VALID [2022-04-08 08:34:27,866 INFO L272 TraceCheckUtils]: 6: Hoare triple {15834#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {15834#true} is VALID [2022-04-08 08:34:27,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {15834#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {15834#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; {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {15834#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; {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {15834#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {15834#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); {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {15834#true} assume 12292 == #t~mem43;havoc #t~mem43; {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {15834#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; {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {15834#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {15834#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {15834#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {15834#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); {15834#true} is VALID [2022-04-08 08:34:27,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {15834#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {15834#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {15834#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {15834#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); {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {15834#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); {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 24: Hoare triple {15834#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {15834#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); {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {15834#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {15834#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {15834#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {15834#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {15834#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {15834#true} assume 4368 == #t~mem48;havoc #t~mem48; {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {15834#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; {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {15834#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {15834#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); {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {15834#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; {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {15834#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); {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {15834#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {15834#true} ~skip~0 := 0; {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 41: Hoare triple {15834#true} assume !false; {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 42: Hoare triple {15834#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); {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 43: Hoare triple {15834#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {15834#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {15834#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {15834#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {15834#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {15834#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {15834#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15834#true} is VALID [2022-04-08 08:34:27,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {15834#true} assume 4384 == #t~mem50;havoc #t~mem50; {15834#true} is VALID [2022-04-08 08:34:27,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {15834#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {15834#true} is VALID [2022-04-08 08:34:27,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {15834#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {15839#(= 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); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,874 INFO L290 TraceCheckUtils]: 57: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,874 INFO L290 TraceCheckUtils]: 58: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,874 INFO L290 TraceCheckUtils]: 59: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,874 INFO L290 TraceCheckUtils]: 60: Hoare triple {15839#(= 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); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,875 INFO L290 TraceCheckUtils]: 61: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,876 INFO L290 TraceCheckUtils]: 64: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,877 INFO L290 TraceCheckUtils]: 66: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,877 INFO L290 TraceCheckUtils]: 67: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,877 INFO L290 TraceCheckUtils]: 68: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,878 INFO L290 TraceCheckUtils]: 70: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,879 INFO L290 TraceCheckUtils]: 75: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {15839#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:27,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {15839#(= 2 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {15835#false} is VALID [2022-04-08 08:34:27,880 INFO L290 TraceCheckUtils]: 77: Hoare triple {15835#false} assume !false; {15835#false} is VALID [2022-04-08 08:34:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 08:34:27,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:27,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621440705] [2022-04-08 08:34:27,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621440705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:27,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:27,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:27,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:27,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1686239435] [2022-04-08 08:34:27,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1686239435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:27,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:27,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:27,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402283811] [2022-04-08 08:34:27,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:27,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-08 08:34:27,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:27,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:27,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:27,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:34:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:27,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:34:27,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:27,940 INFO L87 Difference]: Start difference. First operand 268 states and 389 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:29,962 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-08 08:34:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:31,042 INFO L93 Difference]: Finished difference Result 539 states and 791 transitions. [2022-04-08 08:34:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:34:31,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-08 08:34:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-08 08:34:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-04-08 08:34:31,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-04-08 08:34:31,462 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-08 08:34:31,473 INFO L225 Difference]: With dead ends: 539 [2022-04-08 08:34:31,473 INFO L226 Difference]: Without dead ends: 402 [2022-04-08 08:34:31,474 INFO L912 BasicCegarLoop]: 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-08 08:34:31,474 INFO L913 BasicCegarLoop]: 319 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 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-08 08:34:31,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-04-08 08:34:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2022-04-08 08:34:31,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:31,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,489 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,490 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:31,501 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-08 08:34:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-08 08:34:31,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:31,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:31,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 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 402 states. [2022-04-08 08:34:31,503 INFO L87 Difference]: Start difference. First operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 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 402 states. [2022-04-08 08:34:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:31,515 INFO L93 Difference]: Finished difference Result 402 states and 583 transitions. [2022-04-08 08:34:31,515 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-08 08:34:31,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:31,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:31,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:31,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 397 states have (on average 1.4584382871536523) internal successors, (579), 397 states have internal predecessors, (579), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 583 transitions. [2022-04-08 08:34:31,531 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 583 transitions. Word has length 78 [2022-04-08 08:34:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:31,531 INFO L478 AbstractCegarLoop]: Abstraction has 402 states and 583 transitions. [2022-04-08 08:34:31,531 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:31,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 402 states and 583 transitions. [2022-04-08 08:34:31,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 583 edges. 583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 583 transitions. [2022-04-08 08:34:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-08 08:34:32,000 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:32,000 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2022-04-08 08:34:32,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:34:32,001 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:32,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash -805380449, now seen corresponding path program 1 times [2022-04-08 08:34:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:32,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [876209890] [2022-04-08 08:34:32,002 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:32,002 INFO L85 PathProgramCache]: Analyzing trace with hash -805380449, now seen corresponding path program 2 times [2022-04-08 08:34:32,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:32,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085633965] [2022-04-08 08:34:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:32,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:32,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {18535#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18529#true} is VALID [2022-04-08 08:34:32,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-08 08:34:32,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18529#true} {18529#true} #592#return; {18529#true} is VALID [2022-04-08 08:34:32,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {18529#true} call ULTIMATE.init(); {18535#(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-08 08:34:32,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {18535#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {18529#true} is VALID [2022-04-08 08:34:32,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {18529#true} assume true; {18529#true} is VALID [2022-04-08 08:34:32,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18529#true} {18529#true} #592#return; {18529#true} is VALID [2022-04-08 08:34:32,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {18529#true} call #t~ret159 := main(); {18529#true} is VALID [2022-04-08 08:34:32,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {18529#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {18529#true} is VALID [2022-04-08 08:34:32,166 INFO L272 TraceCheckUtils]: 6: Hoare triple {18529#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {18529#true} is VALID [2022-04-08 08:34:32,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {18529#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {18529#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; {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {18529#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; {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {18529#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {18529#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); {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {18529#true} assume 12292 == #t~mem43;havoc #t~mem43; {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {18529#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; {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {18529#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {18529#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {18529#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:32,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {18529#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); {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {18529#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {18529#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 21: Hoare triple {18529#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {18529#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); {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {18529#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); {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {18529#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {18529#true} ~skip~0 := 0; {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {18529#true} assume !false; {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 27: Hoare triple {18529#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); {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 28: Hoare triple {18529#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {18529#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:32,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {18529#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:32,169 INFO L290 TraceCheckUtils]: 31: Hoare triple {18529#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:32,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {18529#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18529#true} is VALID [2022-04-08 08:34:32,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {18529#true} assume 4368 == #t~mem48;havoc #t~mem48; {18529#true} is VALID [2022-04-08 08:34:32,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {18529#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; {18529#true} is VALID [2022-04-08 08:34:32,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {18529#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {18534#(= 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); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {18534#(= 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; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {18534#(= 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); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !false; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,171 INFO L290 TraceCheckUtils]: 42: Hoare triple {18534#(= 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); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,173 INFO L290 TraceCheckUtils]: 48: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,173 INFO L290 TraceCheckUtils]: 50: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume 4384 == #t~mem50;havoc #t~mem50; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,174 INFO L290 TraceCheckUtils]: 51: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {18534#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 08:34:32,174 INFO L290 TraceCheckUtils]: 52: Hoare triple {18534#(= ssl3_connect_~blastFlag~0 1)} assume !(1 == ~blastFlag~0); {18530#false} is VALID [2022-04-08 08:34:32,174 INFO L290 TraceCheckUtils]: 53: Hoare triple {18530#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,174 INFO L290 TraceCheckUtils]: 54: Hoare triple {18530#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {18530#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {18530#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); {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {18530#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {18530#false} ~skip~0 := 0; {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 60: Hoare triple {18530#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); {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 61: Hoare triple {18530#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 62: Hoare triple {18530#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 63: Hoare triple {18530#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 64: Hoare triple {18530#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {18530#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,175 INFO L290 TraceCheckUtils]: 66: Hoare triple {18530#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 67: Hoare triple {18530#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 68: Hoare triple {18530#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 69: Hoare triple {18530#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 70: Hoare triple {18530#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 71: Hoare triple {18530#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 72: Hoare triple {18530#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 73: Hoare triple {18530#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 74: Hoare triple {18530#false} assume 4432 == #t~mem56;havoc #t~mem56; {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 75: Hoare triple {18530#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {18530#false} is VALID [2022-04-08 08:34:32,176 INFO L290 TraceCheckUtils]: 76: Hoare triple {18530#false} assume 5 == ~blastFlag~0; {18530#false} is VALID [2022-04-08 08:34:32,177 INFO L290 TraceCheckUtils]: 77: Hoare triple {18530#false} assume !false; {18530#false} is VALID [2022-04-08 08:34:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 08:34:32,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:32,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085633965] [2022-04-08 08:34:32,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085633965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:32,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:32,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:32,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:32,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [876209890] [2022-04-08 08:34:32,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [876209890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:32,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:32,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:32,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124787931] [2022-04-08 08:34:32,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:32,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 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 78 [2022-04-08 08:34:32,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:32,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 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-08 08:34:32,250 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-08 08:34:32,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:34:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:32,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:34:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:32,251 INFO L87 Difference]: Start difference. First operand 402 states and 583 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 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-08 08:34:34,272 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-08 08:34:35,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:35,005 INFO L93 Difference]: Finished difference Result 697 states and 1013 transitions. [2022-04-08 08:34:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:34:35,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 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 78 [2022-04-08 08:34:35,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 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-08 08:34:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-08 08:34:35,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 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-08 08:34:35,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 371 transitions. [2022-04-08 08:34:35,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 371 transitions. [2022-04-08 08:34:35,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:35,317 INFO L225 Difference]: With dead ends: 697 [2022-04-08 08:34:35,317 INFO L226 Difference]: Without dead ends: 426 [2022-04-08 08:34:35,318 INFO L912 BasicCegarLoop]: 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-08 08:34:35,319 INFO L913 BasicCegarLoop]: 199 mSDtfsCounter, 15 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:35,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 363 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 08:34:35,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-04-08 08:34:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-04-08 08:34:35,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:35,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 426 states. Second operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:35,336 INFO L74 IsIncluded]: Start isIncluded. First operand 426 states. Second operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:35,337 INFO L87 Difference]: Start difference. First operand 426 states. Second operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:35,348 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-08 08:34:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-08 08:34:35,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:35,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:35,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 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 426 states. [2022-04-08 08:34:35,352 INFO L87 Difference]: Start difference. First operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 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 426 states. [2022-04-08 08:34:35,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:35,363 INFO L93 Difference]: Finished difference Result 426 states and 615 transitions. [2022-04-08 08:34:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-08 08:34:35,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:35,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:35,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:35,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 421 states have (on average 1.4513064133016627) internal successors, (611), 421 states have internal predecessors, (611), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 615 transitions. [2022-04-08 08:34:35,379 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 615 transitions. Word has length 78 [2022-04-08 08:34:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:35,380 INFO L478 AbstractCegarLoop]: Abstraction has 426 states and 615 transitions. [2022-04-08 08:34:35,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 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-08 08:34:35,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 426 states and 615 transitions. [2022-04-08 08:34:35,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 615 edges. 615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 615 transitions. [2022-04-08 08:34:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 08:34:35,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:35,929 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2022-04-08 08:34:35,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:34:35,929 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1023132448, now seen corresponding path program 1 times [2022-04-08 08:34:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:35,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167593991] [2022-04-08 08:34:35,930 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1023132448, now seen corresponding path program 2 times [2022-04-08 08:34:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:35,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995322708] [2022-04-08 08:34:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:36,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {21642#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21636#true} is VALID [2022-04-08 08:34:36,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-08 08:34:36,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21636#true} {21636#true} #592#return; {21636#true} is VALID [2022-04-08 08:34:36,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {21636#true} call ULTIMATE.init(); {21642#(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-08 08:34:36,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {21642#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #592#return; {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret159 := main(); {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {21636#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L272 TraceCheckUtils]: 6: Hoare triple {21636#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {21636#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {21636#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; {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {21636#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; {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {21636#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {21636#true} is VALID [2022-04-08 08:34:36,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {21636#true} assume 12292 == #t~mem43;havoc #t~mem43; {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {21636#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; {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {21636#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {21636#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {21636#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {21636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 26: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {21636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {21636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {21636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {21636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 32: Hoare triple {21636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {21636#true} assume 4368 == #t~mem48;havoc #t~mem48; {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 34: Hoare triple {21636#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; {21636#true} is VALID [2022-04-08 08:34:36,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {21636#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {21636#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; {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 38: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 39: Hoare triple {21636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 40: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 41: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 42: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 43: Hoare triple {21636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {21636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {21636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 46: Hoare triple {21636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 47: Hoare triple {21636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,146 INFO L290 TraceCheckUtils]: 48: Hoare triple {21636#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 49: Hoare triple {21636#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 50: Hoare triple {21636#true} assume 4384 == #t~mem50;havoc #t~mem50; {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 51: Hoare triple {21636#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {21636#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {21636#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {21636#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 55: Hoare triple {21636#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 56: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 57: Hoare triple {21636#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 58: Hoare triple {21636#true} ~skip~0 := 0; {21636#true} is VALID [2022-04-08 08:34:36,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {21636#true} assume !false; {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 60: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 61: Hoare triple {21636#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 62: Hoare triple {21636#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 63: Hoare triple {21636#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 64: Hoare triple {21636#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 65: Hoare triple {21636#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {21636#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {21636#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 68: Hoare triple {21636#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 69: Hoare triple {21636#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 70: Hoare triple {21636#true} assume 4400 == #t~mem52;havoc #t~mem52; {21636#true} is VALID [2022-04-08 08:34:36,148 INFO L290 TraceCheckUtils]: 71: Hoare triple {21636#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); {21636#true} is VALID [2022-04-08 08:34:36,149 INFO L290 TraceCheckUtils]: 72: Hoare triple {21636#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; {21636#true} is VALID [2022-04-08 08:34:36,161 INFO L290 TraceCheckUtils]: 73: Hoare triple {21636#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,161 INFO L290 TraceCheckUtils]: 74: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,161 INFO L290 TraceCheckUtils]: 75: Hoare triple {21641#(= 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); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {21641#(= 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); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,162 INFO L290 TraceCheckUtils]: 77: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,163 INFO L290 TraceCheckUtils]: 79: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !false; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {21641#(= 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); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,165 INFO L290 TraceCheckUtils]: 85: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,165 INFO L290 TraceCheckUtils]: 86: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,165 INFO L290 TraceCheckUtils]: 87: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,166 INFO L290 TraceCheckUtils]: 88: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,166 INFO L290 TraceCheckUtils]: 90: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,166 INFO L290 TraceCheckUtils]: 91: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume 4432 == #t~mem56;havoc #t~mem56; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,168 INFO L290 TraceCheckUtils]: 95: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {21641#(= 3 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 08:34:36,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {21641#(= 3 ssl3_connect_~blastFlag~0)} assume 5 == ~blastFlag~0; {21637#false} is VALID [2022-04-08 08:34:36,168 INFO L290 TraceCheckUtils]: 97: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-08 08:34:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 08:34:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:36,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995322708] [2022-04-08 08:34:36,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995322708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:36,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:36,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:36,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:36,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [167593991] [2022-04-08 08:34:36,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [167593991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:36,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:36,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530777261] [2022-04-08 08:34:36,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:36,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 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 98 [2022-04-08 08:34:36,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:36,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:36,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:36,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:34:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:36,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:34:36,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:36,228 INFO L87 Difference]: Start difference. First operand 426 states and 615 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:38,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:39,196 INFO L93 Difference]: Finished difference Result 854 states and 1242 transitions. [2022-04-08 08:34:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:34:39,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 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 98 [2022-04-08 08:34:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-08 08:34:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-04-08 08:34:39,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 494 transitions. [2022-04-08 08:34:39,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 494 edges. 494 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:39,569 INFO L225 Difference]: With dead ends: 854 [2022-04-08 08:34:39,569 INFO L226 Difference]: Without dead ends: 559 [2022-04-08 08:34:39,570 INFO L912 BasicCegarLoop]: 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-08 08:34:39,570 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 128 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:39,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:39,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-04-08 08:34:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2022-04-08 08:34:39,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:39,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 559 states. Second operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:39,593 INFO L74 IsIncluded]: Start isIncluded. First operand 559 states. Second operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:39,593 INFO L87 Difference]: Start difference. First operand 559 states. Second operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:39,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:39,610 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-08 08:34:39,610 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-08 08:34:39,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:39,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:39,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 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 559 states. [2022-04-08 08:34:39,613 INFO L87 Difference]: Start difference. First operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 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 559 states. [2022-04-08 08:34:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:39,630 INFO L93 Difference]: Finished difference Result 559 states and 808 transitions. [2022-04-08 08:34:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-08 08:34:39,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:39,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:39,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:39,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 554 states have (on average 1.4512635379061372) internal successors, (804), 554 states have internal predecessors, (804), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 808 transitions. [2022-04-08 08:34:39,655 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 808 transitions. Word has length 98 [2022-04-08 08:34:39,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:39,656 INFO L478 AbstractCegarLoop]: Abstraction has 559 states and 808 transitions. [2022-04-08 08:34:39,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:39,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 559 states and 808 transitions. [2022-04-08 08:34:40,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 808 edges. 808 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 808 transitions. [2022-04-08 08:34:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-08 08:34:40,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:40,276 INFO L499 BasicCegarLoop]: 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-08 08:34:40,276 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:34:40,277 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1619812542, now seen corresponding path program 1 times [2022-04-08 08:34:40,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:40,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315559828] [2022-04-08 08:34:40,278 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1619812542, now seen corresponding path program 2 times [2022-04-08 08:34:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:40,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138350007] [2022-04-08 08:34:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:40,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:40,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {25595#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {25589#true} is VALID [2022-04-08 08:34:40,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-08 08:34:40,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25589#true} {25589#true} #592#return; {25589#true} is VALID [2022-04-08 08:34:40,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {25589#true} call ULTIMATE.init(); {25595#(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-08 08:34:40,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {25595#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {25589#true} is VALID [2022-04-08 08:34:40,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {25589#true} assume true; {25589#true} is VALID [2022-04-08 08:34:40,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25589#true} {25589#true} #592#return; {25589#true} is VALID [2022-04-08 08:34:40,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {25589#true} call #t~ret159 := main(); {25589#true} is VALID [2022-04-08 08:34:40,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {25589#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {25589#true} is VALID [2022-04-08 08:34:40,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {25589#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {25589#true} is VALID [2022-04-08 08:34:40,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {25589#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {25589#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; {25589#true} is VALID [2022-04-08 08:34:40,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {25589#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; {25589#true} is VALID [2022-04-08 08:34:40,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {25589#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {25589#true} assume 12292 == #t~mem43;havoc #t~mem43; {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {25589#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; {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {25589#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {25589#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {25589#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {25589#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {25589#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {25589#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {25589#true} is VALID [2022-04-08 08:34:40,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 26: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 32: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {25589#true} assume 4368 == #t~mem48;havoc #t~mem48; {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {25589#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; {25589#true} is VALID [2022-04-08 08:34:40,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {25589#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 37: Hoare triple {25589#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; {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 43: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 44: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {25589#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {25589#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {25589#true} assume 4384 == #t~mem50;havoc #t~mem50; {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 51: Hoare triple {25589#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 52: Hoare triple {25589#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 53: Hoare triple {25589#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 54: Hoare triple {25589#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 55: Hoare triple {25589#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 58: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-08 08:34:40,483 INFO L290 TraceCheckUtils]: 59: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 64: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 65: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 66: Hoare triple {25589#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 67: Hoare triple {25589#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {25589#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {25589#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {25589#true} assume 4400 == #t~mem52;havoc #t~mem52; {25589#true} is VALID [2022-04-08 08:34:40,484 INFO L290 TraceCheckUtils]: 71: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 72: Hoare triple {25589#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; {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 73: Hoare triple {25589#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 74: Hoare triple {25589#true} assume !(~ret~0 <= 0); {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 75: Hoare triple {25589#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 76: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 77: Hoare triple {25589#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 78: Hoare triple {25589#true} ~skip~0 := 0; {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 79: Hoare triple {25589#true} assume !false; {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 80: Hoare triple {25589#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); {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 81: Hoare triple {25589#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 82: Hoare triple {25589#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 83: Hoare triple {25589#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,485 INFO L290 TraceCheckUtils]: 84: Hoare triple {25589#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,486 INFO L290 TraceCheckUtils]: 85: Hoare triple {25589#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,486 INFO L290 TraceCheckUtils]: 86: Hoare triple {25589#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,486 INFO L290 TraceCheckUtils]: 87: Hoare triple {25589#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,486 INFO L290 TraceCheckUtils]: 88: Hoare triple {25589#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,486 INFO L290 TraceCheckUtils]: 89: Hoare triple {25589#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,486 INFO L290 TraceCheckUtils]: 90: Hoare triple {25589#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,486 INFO L290 TraceCheckUtils]: 91: Hoare triple {25589#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25589#true} is VALID [2022-04-08 08:34:40,486 INFO L290 TraceCheckUtils]: 92: Hoare triple {25589#true} assume 4416 == #t~mem54;havoc #t~mem54; {25589#true} is VALID [2022-04-08 08:34:40,486 INFO L290 TraceCheckUtils]: 93: Hoare triple {25589#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {25589#true} is VALID [2022-04-08 08:34:40,487 INFO L290 TraceCheckUtils]: 94: Hoare triple {25589#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,487 INFO L290 TraceCheckUtils]: 95: Hoare triple {25594#(= 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; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,487 INFO L290 TraceCheckUtils]: 96: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == ~tmp___6~0); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,488 INFO L290 TraceCheckUtils]: 97: Hoare triple {25594#(= 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); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,488 INFO L290 TraceCheckUtils]: 98: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,488 INFO L290 TraceCheckUtils]: 99: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} ~skip~0 := 0; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,489 INFO L290 TraceCheckUtils]: 100: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !false; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,489 INFO L290 TraceCheckUtils]: 101: Hoare triple {25594#(= 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); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,489 INFO L290 TraceCheckUtils]: 102: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,490 INFO L290 TraceCheckUtils]: 103: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,490 INFO L290 TraceCheckUtils]: 104: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,490 INFO L290 TraceCheckUtils]: 105: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,490 INFO L290 TraceCheckUtils]: 106: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,491 INFO L290 TraceCheckUtils]: 107: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,491 INFO L290 TraceCheckUtils]: 108: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,491 INFO L290 TraceCheckUtils]: 109: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,492 INFO L290 TraceCheckUtils]: 110: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,492 INFO L290 TraceCheckUtils]: 111: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,492 INFO L290 TraceCheckUtils]: 112: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,493 INFO L290 TraceCheckUtils]: 113: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,493 INFO L290 TraceCheckUtils]: 114: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,493 INFO L290 TraceCheckUtils]: 115: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume 4432 == #t~mem56;havoc #t~mem56; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,493 INFO L290 TraceCheckUtils]: 116: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {25594#(= ssl3_connect_~blastFlag~0 4)} is VALID [2022-04-08 08:34:40,494 INFO L290 TraceCheckUtils]: 117: Hoare triple {25594#(= ssl3_connect_~blastFlag~0 4)} assume 5 == ~blastFlag~0; {25590#false} is VALID [2022-04-08 08:34:40,494 INFO L290 TraceCheckUtils]: 118: Hoare triple {25590#false} assume !false; {25590#false} is VALID [2022-04-08 08:34:40,494 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-08 08:34:40,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:40,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138350007] [2022-04-08 08:34:40,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138350007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:40,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:40,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:40,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:40,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315559828] [2022-04-08 08:34:40,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315559828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:40,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:40,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:34:40,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381885738] [2022-04-08 08:34:40,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:40,496 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-08 08:34:40,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:40,496 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-08 08:34:40,571 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-08 08:34:40,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:34:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:34:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:34:40,573 INFO L87 Difference]: Start difference. First operand 559 states and 808 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-08 08:34:42,595 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-08 08:34:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:43,588 INFO L93 Difference]: Finished difference Result 1119 states and 1626 transitions. [2022-04-08 08:34:43,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:34:43,588 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-08 08:34:43,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:43,589 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-08 08:34:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-08 08:34:43,592 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-08 08:34:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-04-08 08:34:43,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 492 transitions. [2022-04-08 08:34:43,929 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-08 08:34:43,955 INFO L225 Difference]: With dead ends: 1119 [2022-04-08 08:34:43,955 INFO L226 Difference]: Without dead ends: 691 [2022-04-08 08:34:43,956 INFO L912 BasicCegarLoop]: 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-08 08:34:43,956 INFO L913 BasicCegarLoop]: 316 mSDtfsCounter, 126 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 480 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-08 08:34:43,956 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 480 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 08:34:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-08 08:34:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2022-04-08 08:34:43,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:43,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:43,983 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:43,984 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:44,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:44,007 INFO L93 Difference]: Finished difference Result 691 states and 999 transitions. [2022-04-08 08:34:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 999 transitions. [2022-04-08 08:34:44,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:44,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:44,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 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 691 states. [2022-04-08 08:34:44,012 INFO L87 Difference]: Start difference. First operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 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 691 states. [2022-04-08 08:34:44,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:44,036 INFO L93 Difference]: Finished difference Result 691 states and 999 transitions. [2022-04-08 08:34:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 999 transitions. [2022-04-08 08:34:44,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:44,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:44,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:44,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:44,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 686 states have (on average 1.4504373177842567) internal successors, (995), 686 states have internal predecessors, (995), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 999 transitions. [2022-04-08 08:34:44,072 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 999 transitions. Word has length 119 [2022-04-08 08:34:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:44,072 INFO L478 AbstractCegarLoop]: Abstraction has 691 states and 999 transitions. [2022-04-08 08:34:44,072 INFO L479 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-08 08:34:44,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 691 states and 999 transitions. [2022-04-08 08:34:44,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 999 edges. 999 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 999 transitions. [2022-04-08 08:34:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 08:34:44,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:44,874 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-08 08:34:44,874 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:34:44,874 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:44,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash 409023911, now seen corresponding path program 1 times [2022-04-08 08:34:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:44,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [889879369] [2022-04-08 08:34:44,876 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash 409023911, now seen corresponding path program 2 times [2022-04-08 08:34:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:44,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323095221] [2022-04-08 08:34:44,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:45,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {30607#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {30600#true} is VALID [2022-04-08 08:34:45,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {30600#true} assume true; {30600#true} is VALID [2022-04-08 08:34:45,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30600#true} {30600#true} #592#return; {30600#true} is VALID [2022-04-08 08:34:45,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {30600#true} call ULTIMATE.init(); {30607#(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-08 08:34:45,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {30607#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {30600#true} is VALID [2022-04-08 08:34:45,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {30600#true} assume true; {30600#true} is VALID [2022-04-08 08:34:45,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30600#true} {30600#true} #592#return; {30600#true} is VALID [2022-04-08 08:34:45,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {30600#true} call #t~ret159 := main(); {30600#true} is VALID [2022-04-08 08:34:45,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {30600#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {30600#true} is VALID [2022-04-08 08:34:45,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {30600#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {30600#true} is VALID [2022-04-08 08:34:45,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {30600#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {30600#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; {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {30600#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; {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {30600#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {30600#true} assume !false; {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {30600#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); {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {30600#true} assume 12292 == #t~mem43;havoc #t~mem43; {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {30600#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; {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {30600#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {30600#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {30600#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {30600#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); {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {30600#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {30600#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {30600#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {30600#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); {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {30600#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); {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {30600#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {30600#true} ~skip~0 := 0; {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {30600#true} assume !false; {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {30600#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); {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {30600#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {30600#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {30600#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {30600#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {30600#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {30600#true} assume 4368 == #t~mem48;havoc #t~mem48; {30600#true} is VALID [2022-04-08 08:34:45,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {30600#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; {30600#true} is VALID [2022-04-08 08:34:45,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {30600#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {30600#true} is VALID [2022-04-08 08:34:45,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {30600#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); {30600#true} is VALID [2022-04-08 08:34:45,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {30600#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; {30600#true} is VALID [2022-04-08 08:34:45,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {30600#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); {30600#true} is VALID [2022-04-08 08:34:45,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {30600#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30600#true} is VALID [2022-04-08 08:34:45,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {30600#true} ~skip~0 := 0; {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {30600#true} assume !false; {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {30600#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); {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {30600#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {30600#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {30600#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {30600#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {30600#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {30600#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {30600#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 50: Hoare triple {30600#true} assume 4384 == #t~mem50;havoc #t~mem50; {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 51: Hoare triple {30600#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {30600#true} is VALID [2022-04-08 08:34:45,104 INFO L290 TraceCheckUtils]: 52: Hoare triple {30600#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {30600#true} is VALID [2022-04-08 08:34:45,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {30600#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {30600#true} is VALID [2022-04-08 08:34:45,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {30600#true} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {30605#(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; {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,109 INFO L290 TraceCheckUtils]: 64: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,110 INFO L290 TraceCheckUtils]: 65: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,110 INFO L290 TraceCheckUtils]: 66: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,110 INFO L290 TraceCheckUtils]: 67: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,110 INFO L290 TraceCheckUtils]: 68: Hoare triple {30605#(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); {30605#(not (= 4400 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:34:45,111 INFO L290 TraceCheckUtils]: 69: Hoare triple {30605#(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); {30606#(not (= |ssl3_connect_#t~mem52| 4400))} is VALID [2022-04-08 08:34:45,111 INFO L290 TraceCheckUtils]: 70: Hoare triple {30606#(not (= |ssl3_connect_#t~mem52| 4400))} assume 4400 == #t~mem52;havoc #t~mem52; {30601#false} is VALID [2022-04-08 08:34:45,111 INFO L290 TraceCheckUtils]: 71: Hoare triple {30601#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); {30601#false} is VALID [2022-04-08 08:34:45,111 INFO L290 TraceCheckUtils]: 72: Hoare triple {30601#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; {30601#false} is VALID [2022-04-08 08:34:45,111 INFO L290 TraceCheckUtils]: 73: Hoare triple {30601#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 74: Hoare triple {30601#false} assume !(~ret~0 <= 0); {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 75: Hoare triple {30601#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 76: Hoare triple {30601#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); {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 77: Hoare triple {30601#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 78: Hoare triple {30601#false} ~skip~0 := 0; {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 79: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 80: Hoare triple {30601#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); {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 81: Hoare triple {30601#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 82: Hoare triple {30601#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 83: Hoare triple {30601#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 84: Hoare triple {30601#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,112 INFO L290 TraceCheckUtils]: 85: Hoare triple {30601#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 86: Hoare triple {30601#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 87: Hoare triple {30601#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 88: Hoare triple {30601#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 89: Hoare triple {30601#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 90: Hoare triple {30601#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 91: Hoare triple {30601#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 92: Hoare triple {30601#false} assume 4416 == #t~mem54;havoc #t~mem54; {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 93: Hoare triple {30601#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 94: Hoare triple {30601#false} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 95: Hoare triple {30601#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; {30601#false} is VALID [2022-04-08 08:34:45,113 INFO L290 TraceCheckUtils]: 96: Hoare triple {30601#false} assume !(0 == ~tmp___6~0); {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 97: Hoare triple {30601#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); {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 98: Hoare triple {30601#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 99: Hoare triple {30601#false} ~skip~0 := 0; {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 100: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 101: Hoare triple {30601#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); {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 102: Hoare triple {30601#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 103: Hoare triple {30601#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 104: Hoare triple {30601#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 105: Hoare triple {30601#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 106: Hoare triple {30601#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 107: Hoare triple {30601#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,114 INFO L290 TraceCheckUtils]: 108: Hoare triple {30601#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,115 INFO L290 TraceCheckUtils]: 109: Hoare triple {30601#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,115 INFO L290 TraceCheckUtils]: 110: Hoare triple {30601#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,115 INFO L290 TraceCheckUtils]: 111: Hoare triple {30601#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,115 INFO L290 TraceCheckUtils]: 112: Hoare triple {30601#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,115 INFO L290 TraceCheckUtils]: 113: Hoare triple {30601#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,115 INFO L290 TraceCheckUtils]: 114: Hoare triple {30601#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,115 INFO L290 TraceCheckUtils]: 115: Hoare triple {30601#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,115 INFO L290 TraceCheckUtils]: 116: Hoare triple {30601#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,115 INFO L290 TraceCheckUtils]: 117: Hoare triple {30601#false} assume 4448 == #t~mem58;havoc #t~mem58; {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 118: Hoare triple {30601#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 119: Hoare triple {30601#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 120: Hoare triple {30601#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 121: Hoare triple {30601#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 122: Hoare triple {30601#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 123: Hoare triple {30601#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); {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 124: Hoare triple {30601#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 125: Hoare triple {30601#false} ~skip~0 := 0; {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 126: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 127: Hoare triple {30601#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); {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 128: Hoare triple {30601#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,116 INFO L290 TraceCheckUtils]: 129: Hoare triple {30601#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 130: Hoare triple {30601#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 131: Hoare triple {30601#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 132: Hoare triple {30601#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 133: Hoare triple {30601#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 134: Hoare triple {30601#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 135: Hoare triple {30601#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 136: Hoare triple {30601#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 137: Hoare triple {30601#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 138: Hoare triple {30601#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 139: Hoare triple {30601#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 140: Hoare triple {30601#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {30601#false} is VALID [2022-04-08 08:34:45,117 INFO L290 TraceCheckUtils]: 141: Hoare triple {30601#false} assume 4432 == #t~mem56;havoc #t~mem56; {30601#false} is VALID [2022-04-08 08:34:45,118 INFO L290 TraceCheckUtils]: 142: Hoare triple {30601#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {30601#false} is VALID [2022-04-08 08:34:45,118 INFO L290 TraceCheckUtils]: 143: Hoare triple {30601#false} assume 5 == ~blastFlag~0; {30601#false} is VALID [2022-04-08 08:34:45,118 INFO L290 TraceCheckUtils]: 144: Hoare triple {30601#false} assume !false; {30601#false} is VALID [2022-04-08 08:34:45,118 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-08 08:34:45,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:45,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323095221] [2022-04-08 08:34:45,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323095221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:45,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:45,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:45,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:45,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [889879369] [2022-04-08 08:34:45,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [889879369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:45,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:45,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:45,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320654019] [2022-04-08 08:34:45,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:45,120 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 145 [2022-04-08 08:34:45,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:45,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:45,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:45,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:34:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:45,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:34:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:34:45,204 INFO L87 Difference]: Start difference. First operand 691 states and 999 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:47,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:34:48,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:48,409 INFO L93 Difference]: Finished difference Result 1825 states and 2651 transitions. [2022-04-08 08:34:48,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:34:48,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 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 145 [2022-04-08 08:34:48,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:48,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 08:34:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:48,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2022-04-08 08:34:48,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 480 transitions. [2022-04-08 08:34:48,740 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-08 08:34:48,793 INFO L225 Difference]: With dead ends: 1825 [2022-04-08 08:34:48,793 INFO L226 Difference]: Without dead ends: 1150 [2022-04-08 08:34:48,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:34:48,795 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:48,795 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 286 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:34:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2022-04-08 08:34:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 796. [2022-04-08 08:34:48,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:48,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1150 states. Second operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:48,851 INFO L74 IsIncluded]: Start isIncluded. First operand 1150 states. Second operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:48,852 INFO L87 Difference]: Start difference. First operand 1150 states. Second operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:48,908 INFO L93 Difference]: Finished difference Result 1150 states and 1667 transitions. [2022-04-08 08:34:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1667 transitions. [2022-04-08 08:34:48,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:48,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:48,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 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 1150 states. [2022-04-08 08:34:48,912 INFO L87 Difference]: Start difference. First operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 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 1150 states. [2022-04-08 08:34:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:48,972 INFO L93 Difference]: Finished difference Result 1150 states and 1667 transitions. [2022-04-08 08:34:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1667 transitions. [2022-04-08 08:34:48,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:48,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:48,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:48,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 791 states have (on average 1.4664981036662452) internal successors, (1160), 791 states have internal predecessors, (1160), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1164 transitions. [2022-04-08 08:34:49,005 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1164 transitions. Word has length 145 [2022-04-08 08:34:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:49,006 INFO L478 AbstractCegarLoop]: Abstraction has 796 states and 1164 transitions. [2022-04-08 08:34:49,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:49,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 796 states and 1164 transitions. [2022-04-08 08:34:49,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1164 edges. 1164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:49,954 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1164 transitions. [2022-04-08 08:34:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-08 08:34:49,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:49,955 INFO L499 BasicCegarLoop]: 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, 1, 1] [2022-04-08 08:34:49,956 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:34:49,956 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1531558103, now seen corresponding path program 1 times [2022-04-08 08:34:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:49,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [211142937] [2022-04-08 08:34:49,957 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:34:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1531558103, now seen corresponding path program 2 times [2022-04-08 08:34:49,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:34:49,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591475873] [2022-04-08 08:34:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:34:49,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:34:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:34:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:34:50,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {38161#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {38154#true} is VALID [2022-04-08 08:34:50,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {38154#true} assume true; {38154#true} is VALID [2022-04-08 08:34:50,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38154#true} {38154#true} #592#return; {38154#true} is VALID [2022-04-08 08:34:50,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {38154#true} call ULTIMATE.init(); {38161#(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-08 08:34:50,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {38161#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {38154#true} is VALID [2022-04-08 08:34:50,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {38154#true} assume true; {38154#true} is VALID [2022-04-08 08:34:50,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38154#true} {38154#true} #592#return; {38154#true} is VALID [2022-04-08 08:34:50,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {38154#true} call #t~ret159 := main(); {38154#true} is VALID [2022-04-08 08:34:50,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {38154#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {38154#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {38154#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {38154#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; {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {38154#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; {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {38154#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {38154#true} assume 12292 == #t~mem43;havoc #t~mem43; {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {38154#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; {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {38154#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {38154#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {38154#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {38154#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {38154#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {38154#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {38154#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {38154#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {38154#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {38154#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,194 INFO L290 TraceCheckUtils]: 31: Hoare triple {38154#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {38154#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {38154#true} assume 4368 == #t~mem48;havoc #t~mem48; {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {38154#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; {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 35: Hoare triple {38154#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {38154#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; {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {38154#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 40: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {38154#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {38154#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,195 INFO L290 TraceCheckUtils]: 45: Hoare triple {38154#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 46: Hoare triple {38154#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 47: Hoare triple {38154#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 48: Hoare triple {38154#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 49: Hoare triple {38154#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {38154#true} assume 4384 == #t~mem50;havoc #t~mem50; {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {38154#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {38154#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {38154#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 54: Hoare triple {38154#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 55: Hoare triple {38154#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {38154#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 59: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 60: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 61: Hoare triple {38154#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 62: Hoare triple {38154#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {38154#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 64: Hoare triple {38154#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {38154#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 66: Hoare triple {38154#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 67: Hoare triple {38154#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 68: Hoare triple {38154#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {38154#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {38154#true} assume 4400 == #t~mem52;havoc #t~mem52; {38154#true} is VALID [2022-04-08 08:34:50,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {38154#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; {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 73: Hoare triple {38154#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {38154#true} assume !(~ret~0 <= 0); {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 75: Hoare triple {38154#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 77: Hoare triple {38154#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 78: Hoare triple {38154#true} ~skip~0 := 0; {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 79: Hoare triple {38154#true} assume !false; {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 80: Hoare triple {38154#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); {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 81: Hoare triple {38154#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 82: Hoare triple {38154#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 83: Hoare triple {38154#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,198 INFO L290 TraceCheckUtils]: 84: Hoare triple {38154#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 85: Hoare triple {38154#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 86: Hoare triple {38154#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 87: Hoare triple {38154#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 88: Hoare triple {38154#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 89: Hoare triple {38154#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 90: Hoare triple {38154#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 91: Hoare triple {38154#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 92: Hoare triple {38154#true} assume 4416 == #t~mem54;havoc #t~mem54; {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 93: Hoare triple {38154#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {38154#true} is VALID [2022-04-08 08:34:50,199 INFO L290 TraceCheckUtils]: 94: Hoare triple {38154#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {38154#true} is VALID [2022-04-08 08:34:50,200 INFO L290 TraceCheckUtils]: 95: Hoare triple {38154#true} 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; {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,201 INFO L290 TraceCheckUtils]: 96: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,201 INFO L290 TraceCheckUtils]: 97: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,201 INFO L290 TraceCheckUtils]: 98: Hoare triple {38159#(= 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; {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,202 INFO L290 TraceCheckUtils]: 99: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,202 INFO L290 TraceCheckUtils]: 100: Hoare triple {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,202 INFO L290 TraceCheckUtils]: 101: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,203 INFO L290 TraceCheckUtils]: 102: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,203 INFO L290 TraceCheckUtils]: 103: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,203 INFO L290 TraceCheckUtils]: 104: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,203 INFO L290 TraceCheckUtils]: 105: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,204 INFO L290 TraceCheckUtils]: 106: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,204 INFO L290 TraceCheckUtils]: 107: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,204 INFO L290 TraceCheckUtils]: 108: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,205 INFO L290 TraceCheckUtils]: 109: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,205 INFO L290 TraceCheckUtils]: 110: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,205 INFO L290 TraceCheckUtils]: 111: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,205 INFO L290 TraceCheckUtils]: 112: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,206 INFO L290 TraceCheckUtils]: 113: Hoare triple {38159#(= 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); {38159#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:34:50,206 INFO L290 TraceCheckUtils]: 114: Hoare triple {38159#(= 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); {38160#(= |ssl3_connect_#t~mem56| 4432)} is VALID [2022-04-08 08:34:50,206 INFO L290 TraceCheckUtils]: 115: Hoare triple {38160#(= |ssl3_connect_#t~mem56| 4432)} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 116: Hoare triple {38155#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 117: Hoare triple {38155#false} assume 4448 == #t~mem58;havoc #t~mem58; {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 118: Hoare triple {38155#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 119: Hoare triple {38155#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 120: Hoare triple {38155#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 121: Hoare triple {38155#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 122: Hoare triple {38155#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 123: Hoare triple {38155#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); {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 124: Hoare triple {38155#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 125: Hoare triple {38155#false} ~skip~0 := 0; {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 126: Hoare triple {38155#false} assume !false; {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 127: Hoare triple {38155#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); {38155#false} is VALID [2022-04-08 08:34:50,207 INFO L290 TraceCheckUtils]: 128: Hoare triple {38155#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 129: Hoare triple {38155#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 130: Hoare triple {38155#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 131: Hoare triple {38155#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 132: Hoare triple {38155#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 133: Hoare triple {38155#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 134: Hoare triple {38155#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 135: Hoare triple {38155#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 136: Hoare triple {38155#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 137: Hoare triple {38155#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 138: Hoare triple {38155#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 139: Hoare triple {38155#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 140: Hoare triple {38155#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {38155#false} is VALID [2022-04-08 08:34:50,208 INFO L290 TraceCheckUtils]: 141: Hoare triple {38155#false} assume 4432 == #t~mem56;havoc #t~mem56; {38155#false} is VALID [2022-04-08 08:34:50,209 INFO L290 TraceCheckUtils]: 142: Hoare triple {38155#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {38155#false} is VALID [2022-04-08 08:34:50,209 INFO L290 TraceCheckUtils]: 143: Hoare triple {38155#false} assume 5 == ~blastFlag~0; {38155#false} is VALID [2022-04-08 08:34:50,209 INFO L290 TraceCheckUtils]: 144: Hoare triple {38155#false} assume !false; {38155#false} is VALID [2022-04-08 08:34:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-04-08 08:34:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:34:50,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591475873] [2022-04-08 08:34:50,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591475873] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:50,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:50,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:50,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:34:50,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [211142937] [2022-04-08 08:34:50,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [211142937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:34:50,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:34:50,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:34:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974618097] [2022-04-08 08:34:50,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:34:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 145 [2022-04-08 08:34:50,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:34:50,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:50,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:50,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:34:50,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:50,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:34:50,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:34:50,299 INFO L87 Difference]: Start difference. First operand 796 states and 1164 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:52,328 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-08 08:34:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:53,538 INFO L93 Difference]: Finished difference Result 1783 states and 2599 transitions. [2022-04-08 08:34:53,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:34:53,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 145 [2022-04-08 08:34:53,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:34:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-04-08 08:34:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 414 transitions. [2022-04-08 08:34:53,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 414 transitions. [2022-04-08 08:34:53,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 414 edges. 414 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:53,851 INFO L225 Difference]: With dead ends: 1783 [2022-04-08 08:34:53,851 INFO L226 Difference]: Without dead ends: 1003 [2022-04-08 08:34:53,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:34:53,852 INFO L913 BasicCegarLoop]: 217 mSDtfsCounter, 46 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:34:53,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 525 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:34:53,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-04-08 08:34:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 892. [2022-04-08 08:34:53,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:34:53,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:53,906 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:53,907 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:53,957 INFO L93 Difference]: Finished difference Result 1003 states and 1451 transitions. [2022-04-08 08:34:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1451 transitions. [2022-04-08 08:34:53,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:53,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:53,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 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 1003 states. [2022-04-08 08:34:53,961 INFO L87 Difference]: Start difference. First operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 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 1003 states. [2022-04-08 08:34:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:34:54,013 INFO L93 Difference]: Finished difference Result 1003 states and 1451 transitions. [2022-04-08 08:34:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1451 transitions. [2022-04-08 08:34:54,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:34:54,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:34:54,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:34:54,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:34:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 887 states have (on average 1.483652762119504) internal successors, (1316), 887 states have internal predecessors, (1316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1320 transitions. [2022-04-08 08:34:54,070 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1320 transitions. Word has length 145 [2022-04-08 08:34:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:34:54,070 INFO L478 AbstractCegarLoop]: Abstraction has 892 states and 1320 transitions. [2022-04-08 08:34:54,070 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:34:54,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 892 states and 1320 transitions. [2022-04-08 08:34:55,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1320 edges. 1320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:34:55,201 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1320 transitions. [2022-04-08 08:34:55,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-08 08:34:55,203 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:34:55,203 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:34:55,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:34:55,203 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:34:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:34:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1970264700, now seen corresponding path program 1 times [2022-04-08 08:34:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:34:55,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [338943514] [2022-04-08 08:35:11,174 WARN L232 SmtUtils]: Spent 9.60s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:35:19,354 WARN L232 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:35:22,111 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:35:22,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1970264700, now seen corresponding path program 2 times [2022-04-08 08:35:22,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:35:22,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827344638] [2022-04-08 08:35:22,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:35:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:35:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:35:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:22,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {45529#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {45522#true} is VALID [2022-04-08 08:35:22,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {45522#true} assume true; {45522#true} is VALID [2022-04-08 08:35:22,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45522#true} {45522#true} #592#return; {45522#true} is VALID [2022-04-08 08:35:22,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {45522#true} call ULTIMATE.init(); {45529#(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-08 08:35:22,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {45529#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {45522#true} is VALID [2022-04-08 08:35:22,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {45522#true} assume true; {45522#true} is VALID [2022-04-08 08:35:22,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45522#true} {45522#true} #592#return; {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {45522#true} call #t~ret159 := main(); {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {45522#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L272 TraceCheckUtils]: 6: Hoare triple {45522#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {45522#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {45522#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; {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {45522#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; {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {45522#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {45522#true} assume 12292 == #t~mem43;havoc #t~mem43; {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {45522#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; {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {45522#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {45522#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {45522#true} is VALID [2022-04-08 08:35:22,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {45522#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {45522#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {45522#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {45522#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {45522#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {45522#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {45522#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {45522#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {45522#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {45522#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {45522#true} assume 4368 == #t~mem48;havoc #t~mem48; {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {45522#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; {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {45522#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {45522#true} is VALID [2022-04-08 08:35:22,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {45522#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; {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {45522#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {45522#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 44: Hoare triple {45522#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 45: Hoare triple {45522#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 46: Hoare triple {45522#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 47: Hoare triple {45522#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 48: Hoare triple {45522#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {45522#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {45522#true} assume 4384 == #t~mem50;havoc #t~mem50; {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {45522#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {45522#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {45522#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {45522#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {45522#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {45522#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {45522#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 62: Hoare triple {45522#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 63: Hoare triple {45522#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 64: Hoare triple {45522#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {45522#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {45522#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {45522#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 68: Hoare triple {45522#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 69: Hoare triple {45522#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {45522#true} assume 4400 == #t~mem52;havoc #t~mem52; {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 71: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 72: Hoare triple {45522#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; {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 73: Hoare triple {45522#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {45522#true} assume !(~ret~0 <= 0); {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {45522#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {45522#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {45522#true} ~skip~0 := 0; {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 79: Hoare triple {45522#true} assume !false; {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 80: Hoare triple {45522#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); {45522#true} is VALID [2022-04-08 08:35:22,331 INFO L290 TraceCheckUtils]: 81: Hoare triple {45522#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 82: Hoare triple {45522#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 83: Hoare triple {45522#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 84: Hoare triple {45522#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 85: Hoare triple {45522#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 86: Hoare triple {45522#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {45522#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 88: Hoare triple {45522#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 89: Hoare triple {45522#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 90: Hoare triple {45522#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 91: Hoare triple {45522#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 92: Hoare triple {45522#true} assume 4416 == #t~mem54;havoc #t~mem54; {45522#true} is VALID [2022-04-08 08:35:22,332 INFO L290 TraceCheckUtils]: 93: Hoare triple {45522#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {45522#true} is VALID [2022-04-08 08:35:22,333 INFO L290 TraceCheckUtils]: 94: Hoare triple {45522#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {45522#true} is VALID [2022-04-08 08:35:22,340 INFO L290 TraceCheckUtils]: 95: Hoare triple {45522#true} 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; {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:22,341 INFO L290 TraceCheckUtils]: 96: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:22,341 INFO L290 TraceCheckUtils]: 97: Hoare triple {45527#(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); {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:22,342 INFO L290 TraceCheckUtils]: 98: Hoare triple {45527#(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; {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:22,342 INFO L290 TraceCheckUtils]: 99: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:22,344 INFO L290 TraceCheckUtils]: 100: Hoare triple {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:22,344 INFO L290 TraceCheckUtils]: 101: Hoare triple {45527#(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); {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:22,344 INFO L290 TraceCheckUtils]: 102: Hoare triple {45527#(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); {45527#(not (= 4096 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:35:22,345 INFO L290 TraceCheckUtils]: 103: Hoare triple {45527#(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); {45528#(not (= |ssl3_connect_#t~mem45| 4096))} is VALID [2022-04-08 08:35:22,345 INFO L290 TraceCheckUtils]: 104: Hoare triple {45528#(not (= |ssl3_connect_#t~mem45| 4096))} assume 4096 == #t~mem45;havoc #t~mem45; {45523#false} is VALID [2022-04-08 08:35:22,345 INFO L290 TraceCheckUtils]: 105: Hoare triple {45523#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,345 INFO L290 TraceCheckUtils]: 106: Hoare triple {45523#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {45523#false} is VALID [2022-04-08 08:35:22,345 INFO L290 TraceCheckUtils]: 107: Hoare triple {45523#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 108: Hoare triple {45523#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); {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 109: Hoare triple {45523#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 110: Hoare triple {45523#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 111: Hoare triple {45523#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 112: Hoare triple {45523#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); {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 113: Hoare triple {45523#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); {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 114: Hoare triple {45523#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 115: Hoare triple {45523#false} ~skip~0 := 0; {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 116: Hoare triple {45523#false} assume !false; {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 117: Hoare triple {45523#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); {45523#false} is VALID [2022-04-08 08:35:22,346 INFO L290 TraceCheckUtils]: 118: Hoare triple {45523#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 119: Hoare triple {45523#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 120: Hoare triple {45523#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 121: Hoare triple {45523#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 122: Hoare triple {45523#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 123: Hoare triple {45523#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 124: Hoare triple {45523#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 125: Hoare triple {45523#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 126: Hoare triple {45523#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 127: Hoare triple {45523#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 128: Hoare triple {45523#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 129: Hoare triple {45523#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 130: Hoare triple {45523#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,347 INFO L290 TraceCheckUtils]: 131: Hoare triple {45523#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 132: Hoare triple {45523#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 133: Hoare triple {45523#false} assume 4448 == #t~mem58;havoc #t~mem58; {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 134: Hoare triple {45523#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 135: Hoare triple {45523#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 136: Hoare triple {45523#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 137: Hoare triple {45523#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 138: Hoare triple {45523#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 139: Hoare triple {45523#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); {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 140: Hoare triple {45523#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 141: Hoare triple {45523#false} ~skip~0 := 0; {45523#false} is VALID [2022-04-08 08:35:22,348 INFO L290 TraceCheckUtils]: 142: Hoare triple {45523#false} assume !false; {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 143: Hoare triple {45523#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); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 144: Hoare triple {45523#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 145: Hoare triple {45523#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 146: Hoare triple {45523#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 147: Hoare triple {45523#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 148: Hoare triple {45523#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 149: Hoare triple {45523#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 150: Hoare triple {45523#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 151: Hoare triple {45523#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 152: Hoare triple {45523#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 153: Hoare triple {45523#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,349 INFO L290 TraceCheckUtils]: 154: Hoare triple {45523#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,350 INFO L290 TraceCheckUtils]: 155: Hoare triple {45523#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,350 INFO L290 TraceCheckUtils]: 156: Hoare triple {45523#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {45523#false} is VALID [2022-04-08 08:35:22,350 INFO L290 TraceCheckUtils]: 157: Hoare triple {45523#false} assume 4432 == #t~mem56;havoc #t~mem56; {45523#false} is VALID [2022-04-08 08:35:22,350 INFO L290 TraceCheckUtils]: 158: Hoare triple {45523#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {45523#false} is VALID [2022-04-08 08:35:22,350 INFO L290 TraceCheckUtils]: 159: Hoare triple {45523#false} assume 5 == ~blastFlag~0; {45523#false} is VALID [2022-04-08 08:35:22,350 INFO L290 TraceCheckUtils]: 160: Hoare triple {45523#false} assume !false; {45523#false} is VALID [2022-04-08 08:35:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 08:35:22,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:35:22,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827344638] [2022-04-08 08:35:22,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827344638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:22,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:22,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:35:22,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:35:22,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [338943514] [2022-04-08 08:35:22,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [338943514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:22,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:22,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:35:22,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69001387] [2022-04-08 08:35:22,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:35:22,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 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 161 [2022-04-08 08:35:22,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:35:22,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:22,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:22,439 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:35:22,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:22,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:35:22,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:35:22,440 INFO L87 Difference]: Start difference. First operand 892 states and 1320 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:24,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:35:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:25,815 INFO L93 Difference]: Finished difference Result 2162 states and 3203 transitions. [2022-04-08 08:35:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:35:25,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 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 161 [2022-04-08 08:35:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:35:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:35:25,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 479 transitions. [2022-04-08 08:35:25,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 479 transitions. [2022-04-08 08:35:26,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 479 edges. 479 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:26,213 INFO L225 Difference]: With dead ends: 2162 [2022-04-08 08:35:26,213 INFO L226 Difference]: Without dead ends: 1286 [2022-04-08 08:35:26,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:35:26,215 INFO L913 BasicCegarLoop]: 110 mSDtfsCounter, 118 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:35:26,216 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 306 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:35:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-04-08 08:35:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 897. [2022-04-08 08:35:26,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:35:26,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1286 states. Second operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:26,267 INFO L74 IsIncluded]: Start isIncluded. First operand 1286 states. Second operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:26,268 INFO L87 Difference]: Start difference. First operand 1286 states. Second operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:26,333 INFO L93 Difference]: Finished difference Result 1286 states and 1889 transitions. [2022-04-08 08:35:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1889 transitions. [2022-04-08 08:35:26,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:26,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:26,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 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 1286 states. [2022-04-08 08:35:26,337 INFO L87 Difference]: Start difference. First operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 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 1286 states. [2022-04-08 08:35:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:35:26,403 INFO L93 Difference]: Finished difference Result 1286 states and 1889 transitions. [2022-04-08 08:35:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1889 transitions. [2022-04-08 08:35:26,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:35:26,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:35:26,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:35:26,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:35:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 892 states have (on average 1.4708520179372198) internal successors, (1312), 892 states have internal predecessors, (1312), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1316 transitions. [2022-04-08 08:35:26,475 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1316 transitions. Word has length 161 [2022-04-08 08:35:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:35:26,475 INFO L478 AbstractCegarLoop]: Abstraction has 897 states and 1316 transitions. [2022-04-08 08:35:26,475 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:26,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 897 states and 1316 transitions. [2022-04-08 08:35:27,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1316 edges. 1316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:27,611 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1316 transitions. [2022-04-08 08:35:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-08 08:35:27,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:35:27,613 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:35:27,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:35:27,613 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:35:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:35:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1316927770, now seen corresponding path program 1 times [2022-04-08 08:35:27,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:27,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [422261282] [2022-04-08 08:35:32,975 WARN L232 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 198 DAG size of output: 190 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:35:47,213 WARN L232 SmtUtils]: Spent 12.56s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:35:56,380 WARN L232 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:35:59,128 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:35:59,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1316927770, now seen corresponding path program 2 times [2022-04-08 08:35:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:35:59,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810739473] [2022-04-08 08:35:59,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:35:59,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:35:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:35:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:35:59,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {54231#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {54224#true} is VALID [2022-04-08 08:35:59,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {54224#true} assume true; {54224#true} is VALID [2022-04-08 08:35:59,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54224#true} {54224#true} #592#return; {54224#true} is VALID [2022-04-08 08:35:59,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {54224#true} call ULTIMATE.init(); {54231#(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-08 08:35:59,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {54231#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {54224#true} is VALID [2022-04-08 08:35:59,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {54224#true} assume true; {54224#true} is VALID [2022-04-08 08:35:59,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54224#true} {54224#true} #592#return; {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {54224#true} call #t~ret159 := main(); {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {54224#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L272 TraceCheckUtils]: 6: Hoare triple {54224#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {54224#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {54224#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; {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {54224#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; {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {54224#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {54224#true} assume 12292 == #t~mem43;havoc #t~mem43; {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {54224#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; {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {54224#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {54224#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {54224#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {54224#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {54224#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {54224#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {54224#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {54224#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {54224#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {54224#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {54224#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {54224#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {54224#true} assume 4368 == #t~mem48;havoc #t~mem48; {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {54224#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; {54224#true} is VALID [2022-04-08 08:35:59,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {54224#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {54224#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; {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {54224#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {54224#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {54224#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 45: Hoare triple {54224#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 46: Hoare triple {54224#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {54224#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {54224#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 49: Hoare triple {54224#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 50: Hoare triple {54224#true} assume 4384 == #t~mem50;havoc #t~mem50; {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 51: Hoare triple {54224#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 52: Hoare triple {54224#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 53: Hoare triple {54224#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 54: Hoare triple {54224#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 55: Hoare triple {54224#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {54224#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 58: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-08 08:35:59,342 INFO L290 TraceCheckUtils]: 59: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 60: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 61: Hoare triple {54224#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 62: Hoare triple {54224#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 63: Hoare triple {54224#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 64: Hoare triple {54224#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 65: Hoare triple {54224#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 66: Hoare triple {54224#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {54224#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 68: Hoare triple {54224#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 69: Hoare triple {54224#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,343 INFO L290 TraceCheckUtils]: 70: Hoare triple {54224#true} assume 4400 == #t~mem52;havoc #t~mem52; {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 71: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 72: Hoare triple {54224#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; {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 73: Hoare triple {54224#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 74: Hoare triple {54224#true} assume !(~ret~0 <= 0); {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 75: Hoare triple {54224#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 76: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 77: Hoare triple {54224#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 78: Hoare triple {54224#true} ~skip~0 := 0; {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 79: Hoare triple {54224#true} assume !false; {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 80: Hoare triple {54224#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); {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 81: Hoare triple {54224#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,344 INFO L290 TraceCheckUtils]: 82: Hoare triple {54224#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 83: Hoare triple {54224#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 84: Hoare triple {54224#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 85: Hoare triple {54224#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 86: Hoare triple {54224#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 87: Hoare triple {54224#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 88: Hoare triple {54224#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 89: Hoare triple {54224#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 90: Hoare triple {54224#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 91: Hoare triple {54224#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 92: Hoare triple {54224#true} assume 4416 == #t~mem54;havoc #t~mem54; {54224#true} is VALID [2022-04-08 08:35:59,345 INFO L290 TraceCheckUtils]: 93: Hoare triple {54224#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {54224#true} is VALID [2022-04-08 08:35:59,346 INFO L290 TraceCheckUtils]: 94: Hoare triple {54224#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {54224#true} is VALID [2022-04-08 08:35:59,347 INFO L290 TraceCheckUtils]: 95: Hoare triple {54224#true} 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; {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:35:59,347 INFO L290 TraceCheckUtils]: 96: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:35:59,347 INFO L290 TraceCheckUtils]: 97: Hoare triple {54229#(= 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); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:35:59,348 INFO L290 TraceCheckUtils]: 98: Hoare triple {54229#(= 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; {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:35:59,348 INFO L290 TraceCheckUtils]: 99: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:35:59,348 INFO L290 TraceCheckUtils]: 100: Hoare triple {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:35:59,349 INFO L290 TraceCheckUtils]: 101: Hoare triple {54229#(= 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); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:35:59,349 INFO L290 TraceCheckUtils]: 102: Hoare triple {54229#(= 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); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:35:59,349 INFO L290 TraceCheckUtils]: 103: Hoare triple {54229#(= 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); {54229#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:35:59,365 INFO L290 TraceCheckUtils]: 104: Hoare triple {54229#(= 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); {54230#(= |ssl3_connect_#t~mem46| 4432)} is VALID [2022-04-08 08:35:59,365 INFO L290 TraceCheckUtils]: 105: Hoare triple {54230#(= |ssl3_connect_#t~mem46| 4432)} assume 20480 == #t~mem46;havoc #t~mem46; {54225#false} is VALID [2022-04-08 08:35:59,365 INFO L290 TraceCheckUtils]: 106: Hoare triple {54225#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,365 INFO L290 TraceCheckUtils]: 107: Hoare triple {54225#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {54225#false} is VALID [2022-04-08 08:35:59,365 INFO L290 TraceCheckUtils]: 108: Hoare triple {54225#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 109: Hoare triple {54225#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); {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 110: Hoare triple {54225#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 111: Hoare triple {54225#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 112: Hoare triple {54225#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 113: Hoare triple {54225#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); {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 114: Hoare triple {54225#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); {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 115: Hoare triple {54225#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 116: Hoare triple {54225#false} ~skip~0 := 0; {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 117: Hoare triple {54225#false} assume !false; {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 118: Hoare triple {54225#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); {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 119: Hoare triple {54225#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,366 INFO L290 TraceCheckUtils]: 120: Hoare triple {54225#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 121: Hoare triple {54225#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 122: Hoare triple {54225#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 123: Hoare triple {54225#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 124: Hoare triple {54225#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 125: Hoare triple {54225#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 126: Hoare triple {54225#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 127: Hoare triple {54225#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 128: Hoare triple {54225#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 129: Hoare triple {54225#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 130: Hoare triple {54225#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 131: Hoare triple {54225#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,367 INFO L290 TraceCheckUtils]: 132: Hoare triple {54225#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 133: Hoare triple {54225#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 134: Hoare triple {54225#false} assume 4448 == #t~mem58;havoc #t~mem58; {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 135: Hoare triple {54225#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 136: Hoare triple {54225#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 137: Hoare triple {54225#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 138: Hoare triple {54225#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 139: Hoare triple {54225#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 140: Hoare triple {54225#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); {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 141: Hoare triple {54225#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 142: Hoare triple {54225#false} ~skip~0 := 0; {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 143: Hoare triple {54225#false} assume !false; {54225#false} is VALID [2022-04-08 08:35:59,368 INFO L290 TraceCheckUtils]: 144: Hoare triple {54225#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); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 145: Hoare triple {54225#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 146: Hoare triple {54225#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 147: Hoare triple {54225#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 148: Hoare triple {54225#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 149: Hoare triple {54225#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 150: Hoare triple {54225#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 151: Hoare triple {54225#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 152: Hoare triple {54225#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 153: Hoare triple {54225#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 154: Hoare triple {54225#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 155: Hoare triple {54225#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,369 INFO L290 TraceCheckUtils]: 156: Hoare triple {54225#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,370 INFO L290 TraceCheckUtils]: 157: Hoare triple {54225#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {54225#false} is VALID [2022-04-08 08:35:59,370 INFO L290 TraceCheckUtils]: 158: Hoare triple {54225#false} assume 4432 == #t~mem56;havoc #t~mem56; {54225#false} is VALID [2022-04-08 08:35:59,370 INFO L290 TraceCheckUtils]: 159: Hoare triple {54225#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {54225#false} is VALID [2022-04-08 08:35:59,370 INFO L290 TraceCheckUtils]: 160: Hoare triple {54225#false} assume 5 == ~blastFlag~0; {54225#false} is VALID [2022-04-08 08:35:59,370 INFO L290 TraceCheckUtils]: 161: Hoare triple {54225#false} assume !false; {54225#false} is VALID [2022-04-08 08:35:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 08:35:59,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:35:59,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810739473] [2022-04-08 08:35:59,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810739473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:59,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:59,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:35:59,371 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:35:59,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [422261282] [2022-04-08 08:35:59,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [422261282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:35:59,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:35:59,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:35:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390651051] [2022-04-08 08:35:59,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:35:59,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 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 162 [2022-04-08 08:35:59,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:35:59,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:35:59,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:35:59,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:35:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:35:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:35:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:35:59,468 INFO L87 Difference]: Start difference. First operand 897 states and 1316 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:01,489 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:36:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:02,853 INFO L93 Difference]: Finished difference Result 1889 states and 2743 transitions. [2022-04-08 08:36:02,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:36:02,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 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 162 [2022-04-08 08:36:02,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:36:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:02,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2022-04-08 08:36:02,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2022-04-08 08:36:02,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 412 transitions. [2022-04-08 08:36:03,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:36:03,171 INFO L225 Difference]: With dead ends: 1889 [2022-04-08 08:36:03,171 INFO L226 Difference]: Without dead ends: 1008 [2022-04-08 08:36:03,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:36:03,173 INFO L913 BasicCegarLoop]: 216 mSDtfsCounter, 54 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:36:03,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 523 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 403 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:36:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-04-08 08:36:03,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 897. [2022-04-08 08:36:03,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:36:03,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1008 states. Second operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:03,231 INFO L74 IsIncluded]: Start isIncluded. First operand 1008 states. Second operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:03,232 INFO L87 Difference]: Start difference. First operand 1008 states. Second operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:03,282 INFO L93 Difference]: Finished difference Result 1008 states and 1443 transitions. [2022-04-08 08:36:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1443 transitions. [2022-04-08 08:36:03,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:03,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:03,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 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 1008 states. [2022-04-08 08:36:03,285 INFO L87 Difference]: Start difference. First operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 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 1008 states. [2022-04-08 08:36:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:03,331 INFO L93 Difference]: Finished difference Result 1008 states and 1443 transitions. [2022-04-08 08:36:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1443 transitions. [2022-04-08 08:36:03,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:03,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:03,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:36:03,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:36:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 892 states have (on average 1.4663677130044843) internal successors, (1308), 892 states have internal predecessors, (1308), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1312 transitions. [2022-04-08 08:36:03,377 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1312 transitions. Word has length 162 [2022-04-08 08:36:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:36:03,377 INFO L478 AbstractCegarLoop]: Abstraction has 897 states and 1312 transitions. [2022-04-08 08:36:03,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:03,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 897 states and 1312 transitions. [2022-04-08 08:36:04,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1312 edges. 1312 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:36:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1312 transitions. [2022-04-08 08:36:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-08 08:36:04,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:36:04,475 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:36:04,475 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:36:04,475 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:36:04,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:36:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1395645249, now seen corresponding path program 1 times [2022-04-08 08:36:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:04,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1031805358] [2022-04-08 08:36:21,645 WARN L232 SmtUtils]: Spent 11.29s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:36:31,755 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:36:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1395645249, now seen corresponding path program 2 times [2022-04-08 08:36:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:36:31,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003083293] [2022-04-08 08:36:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:36:31,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:36:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:36:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:36:31,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {61831#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {61824#true} is VALID [2022-04-08 08:36:31,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {61824#true} assume true; {61824#true} is VALID [2022-04-08 08:36:31,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61824#true} {61824#true} #592#return; {61824#true} is VALID [2022-04-08 08:36:31,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {61824#true} call ULTIMATE.init(); {61831#(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-08 08:36:31,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {61831#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {61824#true} is VALID [2022-04-08 08:36:31,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {61824#true} assume true; {61824#true} is VALID [2022-04-08 08:36:31,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61824#true} {61824#true} #592#return; {61824#true} is VALID [2022-04-08 08:36:31,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {61824#true} call #t~ret159 := main(); {61824#true} is VALID [2022-04-08 08:36:31,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {61824#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {61824#true} is VALID [2022-04-08 08:36:31,974 INFO L272 TraceCheckUtils]: 6: Hoare triple {61824#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {61824#true} is VALID [2022-04-08 08:36:31,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {61824#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {61824#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; {61824#true} is VALID [2022-04-08 08:36:31,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {61824#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; {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {61824#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {61824#true} assume 12292 == #t~mem43;havoc #t~mem43; {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {61824#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; {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {61824#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {61824#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {61824#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {61824#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {61824#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {61824#true} is VALID [2022-04-08 08:36:31,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {61824#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {61824#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 27: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {61824#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {61824#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {61824#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {61824#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {61824#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {61824#true} assume 4368 == #t~mem48;havoc #t~mem48; {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {61824#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; {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {61824#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {61824#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; {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {61824#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 41: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {61824#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 44: Hoare triple {61824#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {61824#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {61824#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 47: Hoare triple {61824#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {61824#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {61824#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {61824#true} assume 4384 == #t~mem50;havoc #t~mem50; {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {61824#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {61824#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {61824#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {61824#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {61824#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {61824#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61824#true} is VALID [2022-04-08 08:36:31,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 59: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {61824#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 62: Hoare triple {61824#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 63: Hoare triple {61824#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 64: Hoare triple {61824#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {61824#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 66: Hoare triple {61824#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 67: Hoare triple {61824#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 68: Hoare triple {61824#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {61824#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {61824#true} assume 4400 == #t~mem52;havoc #t~mem52; {61824#true} is VALID [2022-04-08 08:36:31,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 72: Hoare triple {61824#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; {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 73: Hoare triple {61824#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 74: Hoare triple {61824#true} assume !(~ret~0 <= 0); {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {61824#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 76: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {61824#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 78: Hoare triple {61824#true} ~skip~0 := 0; {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 79: Hoare triple {61824#true} assume !false; {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 80: Hoare triple {61824#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); {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 81: Hoare triple {61824#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 82: Hoare triple {61824#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 83: Hoare triple {61824#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,980 INFO L290 TraceCheckUtils]: 84: Hoare triple {61824#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 85: Hoare triple {61824#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 86: Hoare triple {61824#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 87: Hoare triple {61824#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 88: Hoare triple {61824#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 89: Hoare triple {61824#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 90: Hoare triple {61824#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 91: Hoare triple {61824#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 92: Hoare triple {61824#true} assume 4416 == #t~mem54;havoc #t~mem54; {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 93: Hoare triple {61824#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {61824#true} is VALID [2022-04-08 08:36:31,981 INFO L290 TraceCheckUtils]: 94: Hoare triple {61824#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {61824#true} is VALID [2022-04-08 08:36:31,982 INFO L290 TraceCheckUtils]: 95: Hoare triple {61824#true} 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; {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,983 INFO L290 TraceCheckUtils]: 96: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(0 == ~tmp___6~0); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,983 INFO L290 TraceCheckUtils]: 97: Hoare triple {61829#(not (= 4099 (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); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,983 INFO L290 TraceCheckUtils]: 98: Hoare triple {61829#(not (= 4099 (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; {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,984 INFO L290 TraceCheckUtils]: 99: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,984 INFO L290 TraceCheckUtils]: 100: Hoare triple {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,984 INFO L290 TraceCheckUtils]: 101: Hoare triple {61829#(not (= 4099 (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); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,985 INFO L290 TraceCheckUtils]: 102: Hoare triple {61829#(not (= 4099 (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); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,985 INFO L290 TraceCheckUtils]: 103: Hoare triple {61829#(not (= 4099 (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); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,985 INFO L290 TraceCheckUtils]: 104: Hoare triple {61829#(not (= 4099 (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); {61829#(not (= 4099 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:36:31,986 INFO L290 TraceCheckUtils]: 105: Hoare triple {61829#(not (= 4099 (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); {61830#(not (= |ssl3_connect_#t~mem47| 4099))} is VALID [2022-04-08 08:36:31,986 INFO L290 TraceCheckUtils]: 106: Hoare triple {61830#(not (= |ssl3_connect_#t~mem47| 4099))} assume 4099 == #t~mem47;havoc #t~mem47; {61825#false} is VALID [2022-04-08 08:36:31,986 INFO L290 TraceCheckUtils]: 107: Hoare triple {61825#false} call write~int(0, ~s.base, 36 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,986 INFO L290 TraceCheckUtils]: 108: Hoare triple {61825#false} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {61825#false} is VALID [2022-04-08 08:36:31,986 INFO L290 TraceCheckUtils]: 109: Hoare triple {61825#false} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,986 INFO L290 TraceCheckUtils]: 110: Hoare triple {61825#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); {61825#false} is VALID [2022-04-08 08:36:31,986 INFO L290 TraceCheckUtils]: 111: Hoare triple {61825#false} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 112: Hoare triple {61825#false} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 113: Hoare triple {61825#false} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 114: Hoare triple {61825#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); {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 115: Hoare triple {61825#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); {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 116: Hoare triple {61825#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 117: Hoare triple {61825#false} ~skip~0 := 0; {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 118: Hoare triple {61825#false} assume !false; {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 119: Hoare triple {61825#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); {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 120: Hoare triple {61825#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 121: Hoare triple {61825#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 122: Hoare triple {61825#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,987 INFO L290 TraceCheckUtils]: 123: Hoare triple {61825#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 124: Hoare triple {61825#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 125: Hoare triple {61825#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 126: Hoare triple {61825#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 127: Hoare triple {61825#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 128: Hoare triple {61825#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 129: Hoare triple {61825#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 130: Hoare triple {61825#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 131: Hoare triple {61825#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 132: Hoare triple {61825#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 133: Hoare triple {61825#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 134: Hoare triple {61825#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,988 INFO L290 TraceCheckUtils]: 135: Hoare triple {61825#false} assume 4448 == #t~mem58;havoc #t~mem58; {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 136: Hoare triple {61825#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 137: Hoare triple {61825#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 138: Hoare triple {61825#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 139: Hoare triple {61825#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 140: Hoare triple {61825#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 141: Hoare triple {61825#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); {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 142: Hoare triple {61825#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 143: Hoare triple {61825#false} ~skip~0 := 0; {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 144: Hoare triple {61825#false} assume !false; {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 145: Hoare triple {61825#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); {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 146: Hoare triple {61825#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,989 INFO L290 TraceCheckUtils]: 147: Hoare triple {61825#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 148: Hoare triple {61825#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 149: Hoare triple {61825#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 150: Hoare triple {61825#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 151: Hoare triple {61825#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 152: Hoare triple {61825#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 153: Hoare triple {61825#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 154: Hoare triple {61825#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 155: Hoare triple {61825#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 156: Hoare triple {61825#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 157: Hoare triple {61825#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 158: Hoare triple {61825#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {61825#false} is VALID [2022-04-08 08:36:31,990 INFO L290 TraceCheckUtils]: 159: Hoare triple {61825#false} assume 4432 == #t~mem56;havoc #t~mem56; {61825#false} is VALID [2022-04-08 08:36:31,991 INFO L290 TraceCheckUtils]: 160: Hoare triple {61825#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {61825#false} is VALID [2022-04-08 08:36:31,991 INFO L290 TraceCheckUtils]: 161: Hoare triple {61825#false} assume 5 == ~blastFlag~0; {61825#false} is VALID [2022-04-08 08:36:31,991 INFO L290 TraceCheckUtils]: 162: Hoare triple {61825#false} assume !false; {61825#false} is VALID [2022-04-08 08:36:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 08:36:31,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:36:31,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003083293] [2022-04-08 08:36:31,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003083293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:31,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:31,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:31,992 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:36:31,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1031805358] [2022-04-08 08:36:31,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1031805358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:36:31,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:36:31,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:36:31,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615160522] [2022-04-08 08:36:31,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:36:31,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 163 [2022-04-08 08:36:31,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:36:31,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:32,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:36:32,076 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:36:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:36:32,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:36:32,077 INFO L87 Difference]: Start difference. First operand 897 states and 1312 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:34,097 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:36:35,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:35,331 INFO L93 Difference]: Finished difference Result 2167 states and 3177 transitions. [2022-04-08 08:36:35,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:36:35,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 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 163 [2022-04-08 08:36:35,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:36:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-08 08:36:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2022-04-08 08:36:35,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2022-04-08 08:36:35,671 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-08 08:36:35,737 INFO L225 Difference]: With dead ends: 2167 [2022-04-08 08:36:35,737 INFO L226 Difference]: Without dead ends: 1286 [2022-04-08 08:36:35,739 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:36:35,739 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 115 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:36:35,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:36:35,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-04-08 08:36:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 907. [2022-04-08 08:36:35,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:36:35,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1286 states. Second operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:35,805 INFO L74 IsIncluded]: Start isIncluded. First operand 1286 states. Second operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:35,805 INFO L87 Difference]: Start difference. First operand 1286 states. Second operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:35,860 INFO L93 Difference]: Finished difference Result 1286 states and 1871 transitions. [2022-04-08 08:36:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1871 transitions. [2022-04-08 08:36:35,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:35,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:35,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 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 1286 states. [2022-04-08 08:36:35,863 INFO L87 Difference]: Start difference. First operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 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 1286 states. [2022-04-08 08:36:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:36:35,922 INFO L93 Difference]: Finished difference Result 1286 states and 1871 transitions. [2022-04-08 08:36:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1871 transitions. [2022-04-08 08:36:35,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:36:35,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:36:35,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:36:35,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:36:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 902 states have (on average 1.4567627494456763) internal successors, (1314), 902 states have internal predecessors, (1314), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:35,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1318 transitions. [2022-04-08 08:36:35,962 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1318 transitions. Word has length 163 [2022-04-08 08:36:35,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:36:35,963 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1318 transitions. [2022-04-08 08:36:35,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:36:35,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1318 transitions. [2022-04-08 08:36:37,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1318 edges. 1318 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:36:37,132 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1318 transitions. [2022-04-08 08:36:37,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-08 08:36:37,133 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:36:37,135 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:36:37,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:36:37,135 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:36:37,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:36:37,136 INFO L85 PathProgramCache]: Analyzing trace with hash -863179426, now seen corresponding path program 1 times [2022-04-08 08:36:37,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:36:37,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718434771] [2022-04-08 08:36:47,699 WARN L232 SmtUtils]: Spent 10.56s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:36:56,735 WARN L232 SmtUtils]: Spent 5.97s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:37:03,657 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:37:03,657 INFO L85 PathProgramCache]: Analyzing trace with hash -863179426, now seen corresponding path program 2 times [2022-04-08 08:37:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:37:03,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444592819] [2022-04-08 08:37:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:37:03,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:37:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:37:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:03,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {70564#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {70556#true} is VALID [2022-04-08 08:37:03,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {70556#true} assume true; {70556#true} is VALID [2022-04-08 08:37:03,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70556#true} {70556#true} #592#return; {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {70556#true} call ULTIMATE.init(); {70564#(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-08 08:37:03,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {70564#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {70556#true} assume true; {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70556#true} {70556#true} #592#return; {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {70556#true} call #t~ret159 := main(); {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {70556#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {70556#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {70556#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {70556#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70556#true} is VALID [2022-04-08 08:37:03,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {70556#true} assume 12292 == #t~mem43;havoc #t~mem43; {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {70556#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {70556#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {70556#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {70556#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {70556#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {70556#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:03,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {70556#true} assume 4368 == #t~mem48;havoc #t~mem48; {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {70556#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70556#true} is VALID [2022-04-08 08:37:03,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 40: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 41: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 42: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {70556#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {70556#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:03,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {70556#true} assume 4384 == #t~mem50;havoc #t~mem50; {70556#true} is VALID [2022-04-08 08:37:03,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {70556#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {70556#true} is VALID [2022-04-08 08:37:03,902 INFO L290 TraceCheckUtils]: 52: Hoare triple {70556#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70556#true} is VALID [2022-04-08 08:37:03,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {70556#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {70561#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:03,903 INFO L290 TraceCheckUtils]: 54: Hoare triple {70561#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,904 INFO L290 TraceCheckUtils]: 55: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,906 INFO L290 TraceCheckUtils]: 60: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,906 INFO L290 TraceCheckUtils]: 61: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,907 INFO L290 TraceCheckUtils]: 63: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,907 INFO L290 TraceCheckUtils]: 64: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,908 INFO L290 TraceCheckUtils]: 65: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,908 INFO L290 TraceCheckUtils]: 66: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,908 INFO L290 TraceCheckUtils]: 67: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,909 INFO L290 TraceCheckUtils]: 68: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,909 INFO L290 TraceCheckUtils]: 69: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,909 INFO L290 TraceCheckUtils]: 70: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem52;havoc #t~mem52; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,910 INFO L290 TraceCheckUtils]: 71: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,910 INFO L290 TraceCheckUtils]: 72: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,911 INFO L290 TraceCheckUtils]: 73: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,911 INFO L290 TraceCheckUtils]: 74: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,912 INFO L290 TraceCheckUtils]: 75: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,913 INFO L290 TraceCheckUtils]: 76: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,913 INFO L290 TraceCheckUtils]: 77: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,913 INFO L290 TraceCheckUtils]: 78: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,914 INFO L290 TraceCheckUtils]: 79: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,914 INFO L290 TraceCheckUtils]: 80: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,914 INFO L290 TraceCheckUtils]: 81: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,915 INFO L290 TraceCheckUtils]: 82: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,915 INFO L290 TraceCheckUtils]: 83: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,915 INFO L290 TraceCheckUtils]: 84: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,916 INFO L290 TraceCheckUtils]: 85: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,916 INFO L290 TraceCheckUtils]: 86: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,916 INFO L290 TraceCheckUtils]: 87: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,917 INFO L290 TraceCheckUtils]: 88: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,917 INFO L290 TraceCheckUtils]: 89: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,918 INFO L290 TraceCheckUtils]: 90: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,918 INFO L290 TraceCheckUtils]: 91: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,918 INFO L290 TraceCheckUtils]: 92: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem54;havoc #t~mem54; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,919 INFO L290 TraceCheckUtils]: 93: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,919 INFO L290 TraceCheckUtils]: 94: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,920 INFO L290 TraceCheckUtils]: 95: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,921 INFO L290 TraceCheckUtils]: 96: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,921 INFO L290 TraceCheckUtils]: 97: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,921 INFO L290 TraceCheckUtils]: 98: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,922 INFO L290 TraceCheckUtils]: 99: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,922 INFO L290 TraceCheckUtils]: 100: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,923 INFO L290 TraceCheckUtils]: 101: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,923 INFO L290 TraceCheckUtils]: 102: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,923 INFO L290 TraceCheckUtils]: 103: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,924 INFO L290 TraceCheckUtils]: 104: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,924 INFO L290 TraceCheckUtils]: 105: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,924 INFO L290 TraceCheckUtils]: 106: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,925 INFO L290 TraceCheckUtils]: 107: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,925 INFO L290 TraceCheckUtils]: 108: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,926 INFO L290 TraceCheckUtils]: 109: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4384 == #t~mem50;havoc #t~mem50; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,926 INFO L290 TraceCheckUtils]: 110: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,926 INFO L290 TraceCheckUtils]: 111: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:37:03,927 INFO L290 TraceCheckUtils]: 112: Hoare triple {70562#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {70563#(= |ssl3_connect_#t~mem89| 0)} is VALID [2022-04-08 08:37:03,927 INFO L290 TraceCheckUtils]: 113: Hoare triple {70563#(= |ssl3_connect_#t~mem89| 0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,927 INFO L290 TraceCheckUtils]: 114: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,927 INFO L290 TraceCheckUtils]: 115: Hoare triple {70557#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); {70557#false} is VALID [2022-04-08 08:37:03,927 INFO L290 TraceCheckUtils]: 116: Hoare triple {70557#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70557#false} is VALID [2022-04-08 08:37:03,927 INFO L290 TraceCheckUtils]: 117: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 118: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 119: Hoare triple {70557#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); {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 120: Hoare triple {70557#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 121: Hoare triple {70557#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 122: Hoare triple {70557#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 123: Hoare triple {70557#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 124: Hoare triple {70557#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 125: Hoare triple {70557#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 126: Hoare triple {70557#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 127: Hoare triple {70557#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,928 INFO L290 TraceCheckUtils]: 128: Hoare triple {70557#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 129: Hoare triple {70557#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 130: Hoare triple {70557#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 131: Hoare triple {70557#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 132: Hoare triple {70557#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 133: Hoare triple {70557#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 134: Hoare triple {70557#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 135: Hoare triple {70557#false} assume 4448 == #t~mem58;havoc #t~mem58; {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 136: Hoare triple {70557#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 137: Hoare triple {70557#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 138: Hoare triple {70557#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 139: Hoare triple {70557#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,929 INFO L290 TraceCheckUtils]: 140: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 141: Hoare triple {70557#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); {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 142: Hoare triple {70557#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 143: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 144: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 145: Hoare triple {70557#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); {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 146: Hoare triple {70557#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 147: Hoare triple {70557#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 148: Hoare triple {70557#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 149: Hoare triple {70557#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 150: Hoare triple {70557#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 151: Hoare triple {70557#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,930 INFO L290 TraceCheckUtils]: 152: Hoare triple {70557#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 153: Hoare triple {70557#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 154: Hoare triple {70557#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 155: Hoare triple {70557#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 156: Hoare triple {70557#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 157: Hoare triple {70557#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 158: Hoare triple {70557#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 159: Hoare triple {70557#false} assume 4432 == #t~mem56;havoc #t~mem56; {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 160: Hoare triple {70557#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 161: Hoare triple {70557#false} assume 5 == ~blastFlag~0; {70557#false} is VALID [2022-04-08 08:37:03,931 INFO L290 TraceCheckUtils]: 162: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-08 08:37:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 229 proven. 1 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-04-08 08:37:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:37:03,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444592819] [2022-04-08 08:37:03,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444592819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:37:03,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682517035] [2022-04-08 08:37:03,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:37:03,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:37:03,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:37:03,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:37:03,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 08:37:42,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:37:42,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:37:42,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 08:37:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:37:42,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:37:42,348 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:37:42,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-08 08:37:42,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-08 08:37:42,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {70556#true} call ULTIMATE.init(); {70556#true} is VALID [2022-04-08 08:37:42,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {70556#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {70556#true} assume true; {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70556#true} {70556#true} #592#return; {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {70556#true} call #t~ret159 := main(); {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {70556#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L272 TraceCheckUtils]: 6: Hoare triple {70556#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {70556#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {70556#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {70556#true} is VALID [2022-04-08 08:37:42,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {70556#true} assume 12292 == #t~mem43;havoc #t~mem43; {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {70556#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {70556#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {70556#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {70556#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {70556#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {70556#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {70556#true} is VALID [2022-04-08 08:37:42,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 23: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 24: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 33: Hoare triple {70556#true} assume 4368 == #t~mem48;havoc #t~mem48; {70556#true} is VALID [2022-04-08 08:37:42,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 35: Hoare triple {70556#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 37: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 38: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 44: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 47: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 48: Hoare triple {70556#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 49: Hoare triple {70556#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 50: Hoare triple {70556#true} assume 4384 == #t~mem50;havoc #t~mem50; {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {70556#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {70556#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {70556#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {70556#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {70556#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 58: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 59: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 60: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 61: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 62: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 63: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 64: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 65: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 66: Hoare triple {70556#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 67: Hoare triple {70556#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 68: Hoare triple {70556#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,581 INFO L290 TraceCheckUtils]: 69: Hoare triple {70556#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 70: Hoare triple {70556#true} assume 4400 == #t~mem52;havoc #t~mem52; {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 71: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 72: Hoare triple {70556#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; {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 73: Hoare triple {70556#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 74: Hoare triple {70556#true} assume !(~ret~0 <= 0); {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 75: Hoare triple {70556#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 77: Hoare triple {70556#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 78: Hoare triple {70556#true} ~skip~0 := 0; {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 79: Hoare triple {70556#true} assume !false; {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 80: Hoare triple {70556#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); {70556#true} is VALID [2022-04-08 08:37:42,582 INFO L290 TraceCheckUtils]: 81: Hoare triple {70556#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 82: Hoare triple {70556#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 83: Hoare triple {70556#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 84: Hoare triple {70556#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 85: Hoare triple {70556#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 86: Hoare triple {70556#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 87: Hoare triple {70556#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 88: Hoare triple {70556#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 89: Hoare triple {70556#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 90: Hoare triple {70556#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 91: Hoare triple {70556#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 92: Hoare triple {70556#true} assume 4416 == #t~mem54;havoc #t~mem54; {70556#true} is VALID [2022-04-08 08:37:42,583 INFO L290 TraceCheckUtils]: 93: Hoare triple {70556#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {70556#true} is VALID [2022-04-08 08:37:42,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {70556#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {70556#true} is VALID [2022-04-08 08:37:42,585 INFO L290 TraceCheckUtils]: 95: Hoare triple {70556#true} 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; {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,585 INFO L290 TraceCheckUtils]: 96: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,586 INFO L290 TraceCheckUtils]: 97: Hoare triple {70853#(= 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); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,586 INFO L290 TraceCheckUtils]: 98: Hoare triple {70853#(= 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; {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,586 INFO L290 TraceCheckUtils]: 99: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,587 INFO L290 TraceCheckUtils]: 100: Hoare triple {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,587 INFO L290 TraceCheckUtils]: 101: Hoare triple {70853#(= 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); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,588 INFO L290 TraceCheckUtils]: 102: Hoare triple {70853#(= 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); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,588 INFO L290 TraceCheckUtils]: 103: Hoare triple {70853#(= 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); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,588 INFO L290 TraceCheckUtils]: 104: Hoare triple {70853#(= 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); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,589 INFO L290 TraceCheckUtils]: 105: Hoare triple {70853#(= 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); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,589 INFO L290 TraceCheckUtils]: 106: Hoare triple {70853#(= 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); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,589 INFO L290 TraceCheckUtils]: 107: Hoare triple {70853#(= 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); {70853#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:37:42,590 INFO L290 TraceCheckUtils]: 108: Hoare triple {70853#(= 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); {70893#(= |ssl3_connect_#t~mem50| 4432)} is VALID [2022-04-08 08:37:42,590 INFO L290 TraceCheckUtils]: 109: Hoare triple {70893#(= |ssl3_connect_#t~mem50| 4432)} assume 4384 == #t~mem50;havoc #t~mem50; {70557#false} is VALID [2022-04-08 08:37:42,590 INFO L290 TraceCheckUtils]: 110: Hoare triple {70557#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {70557#false} is VALID [2022-04-08 08:37:42,590 INFO L290 TraceCheckUtils]: 111: Hoare triple {70557#false} assume !(1 == ~blastFlag~0); {70557#false} is VALID [2022-04-08 08:37:42,590 INFO L290 TraceCheckUtils]: 112: Hoare triple {70557#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,591 INFO L290 TraceCheckUtils]: 113: Hoare triple {70557#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,591 INFO L290 TraceCheckUtils]: 114: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,591 INFO L290 TraceCheckUtils]: 115: Hoare triple {70557#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); {70557#false} is VALID [2022-04-08 08:37:42,591 INFO L290 TraceCheckUtils]: 116: Hoare triple {70557#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70557#false} is VALID [2022-04-08 08:37:42,591 INFO L290 TraceCheckUtils]: 117: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-08 08:37:42,591 INFO L290 TraceCheckUtils]: 118: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-08 08:37:42,591 INFO L290 TraceCheckUtils]: 119: Hoare triple {70557#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); {70557#false} is VALID [2022-04-08 08:37:42,593 INFO L290 TraceCheckUtils]: 120: Hoare triple {70557#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 121: Hoare triple {70557#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 122: Hoare triple {70557#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 123: Hoare triple {70557#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 124: Hoare triple {70557#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 125: Hoare triple {70557#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 126: Hoare triple {70557#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 127: Hoare triple {70557#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 128: Hoare triple {70557#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 129: Hoare triple {70557#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,594 INFO L290 TraceCheckUtils]: 130: Hoare triple {70557#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 131: Hoare triple {70557#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 132: Hoare triple {70557#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 133: Hoare triple {70557#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 134: Hoare triple {70557#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 135: Hoare triple {70557#false} assume 4448 == #t~mem58;havoc #t~mem58; {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 136: Hoare triple {70557#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 137: Hoare triple {70557#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 138: Hoare triple {70557#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 139: Hoare triple {70557#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 140: Hoare triple {70557#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 141: Hoare triple {70557#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); {70557#false} is VALID [2022-04-08 08:37:42,595 INFO L290 TraceCheckUtils]: 142: Hoare triple {70557#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 143: Hoare triple {70557#false} ~skip~0 := 0; {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 144: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 145: Hoare triple {70557#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); {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 146: Hoare triple {70557#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 147: Hoare triple {70557#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 148: Hoare triple {70557#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 149: Hoare triple {70557#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 150: Hoare triple {70557#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 151: Hoare triple {70557#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,596 INFO L290 TraceCheckUtils]: 152: Hoare triple {70557#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 153: Hoare triple {70557#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 154: Hoare triple {70557#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 155: Hoare triple {70557#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 156: Hoare triple {70557#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 157: Hoare triple {70557#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 158: Hoare triple {70557#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 159: Hoare triple {70557#false} assume 4432 == #t~mem56;havoc #t~mem56; {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 160: Hoare triple {70557#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 161: Hoare triple {70557#false} assume 5 == ~blastFlag~0; {70557#false} is VALID [2022-04-08 08:37:42,597 INFO L290 TraceCheckUtils]: 162: Hoare triple {70557#false} assume !false; {70557#false} is VALID [2022-04-08 08:37:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 08:37:42,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:37:42,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682517035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:42,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:37:42,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-04-08 08:37:42,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:37:42,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718434771] [2022-04-08 08:37:42,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718434771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:37:42,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:37:42,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:37:42,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617910647] [2022-04-08 08:37:42,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:37:42,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 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 163 [2022-04-08 08:37:42,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:37:42,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:42,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:42,691 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:37:42,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:42,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:37:42,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:37:42,691 INFO L87 Difference]: Start difference. First operand 907 states and 1318 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:46,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:37:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:49,587 INFO L93 Difference]: Finished difference Result 1873 states and 2703 transitions. [2022-04-08 08:37:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:37:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 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 163 [2022-04-08 08:37:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:37:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2022-04-08 08:37:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2022-04-08 08:37:49,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 399 transitions. [2022-04-08 08:37:49,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:49,886 INFO L225 Difference]: With dead ends: 1873 [2022-04-08 08:37:49,886 INFO L226 Difference]: Without dead ends: 982 [2022-04-08 08:37:49,887 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 08:37:49,888 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 41 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:37:49,888 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 511 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 08:37:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2022-04-08 08:37:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 907. [2022-04-08 08:37:49,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:37:49,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 982 states. Second operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:49,948 INFO L74 IsIncluded]: Start isIncluded. First operand 982 states. Second operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:49,949 INFO L87 Difference]: Start difference. First operand 982 states. Second operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:49,995 INFO L93 Difference]: Finished difference Result 982 states and 1401 transitions. [2022-04-08 08:37:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1401 transitions. [2022-04-08 08:37:49,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:49,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:49,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 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 982 states. [2022-04-08 08:37:49,999 INFO L87 Difference]: Start difference. First operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 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 982 states. [2022-04-08 08:37:50,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:37:50,046 INFO L93 Difference]: Finished difference Result 982 states and 1401 transitions. [2022-04-08 08:37:50,047 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1401 transitions. [2022-04-08 08:37:50,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:37:50,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:37:50,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:37:50,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:37:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 902 states have (on average 1.4523281596452329) internal successors, (1310), 902 states have internal predecessors, (1310), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1314 transitions. [2022-04-08 08:37:50,112 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1314 transitions. Word has length 163 [2022-04-08 08:37:50,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:37:50,113 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1314 transitions. [2022-04-08 08:37:50,113 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:37:50,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1314 transitions. [2022-04-08 08:37:51,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1314 edges. 1314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:37:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1314 transitions. [2022-04-08 08:37:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-08 08:37:51,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:37:51,274 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:37:51,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 08:37:51,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 08:37:51,474 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:37:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:37:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1898118871, now seen corresponding path program 1 times [2022-04-08 08:37:51,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:37:51,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1056774716] [2022-04-08 08:38:04,504 WARN L232 SmtUtils]: Spent 13.02s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:38:15,551 WARN L232 SmtUtils]: Spent 7.31s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:38:22,875 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:38:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1898118871, now seen corresponding path program 2 times [2022-04-08 08:38:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:38:22,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041607903] [2022-04-08 08:38:22,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:38:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:38:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:23,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:38:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:38:23,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {78589#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {78581#true} is VALID [2022-04-08 08:38:23,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {78581#true} assume true; {78581#true} is VALID [2022-04-08 08:38:23,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78581#true} {78581#true} #592#return; {78581#true} is VALID [2022-04-08 08:38:23,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {78581#true} call ULTIMATE.init(); {78589#(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-08 08:38:23,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {78589#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {78581#true} assume true; {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78581#true} {78581#true} #592#return; {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {78581#true} call #t~ret159 := main(); {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {78581#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {78581#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {78581#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {78581#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {78581#true} assume 12292 == #t~mem43;havoc #t~mem43; {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:38:23,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {78581#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {78581#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {78581#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {78581#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {78581#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {78581#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 22: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 23: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {78581#true} assume 4368 == #t~mem48;havoc #t~mem48; {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 34: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 35: Hoare triple {78581#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 36: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 37: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 38: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 41: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,118 INFO L290 TraceCheckUtils]: 46: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,119 INFO L290 TraceCheckUtils]: 47: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {78581#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {78581#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:38:23,119 INFO L290 TraceCheckUtils]: 50: Hoare triple {78581#true} assume 4384 == #t~mem50;havoc #t~mem50; {78581#true} is VALID [2022-04-08 08:38:23,119 INFO L290 TraceCheckUtils]: 51: Hoare triple {78581#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {78581#true} is VALID [2022-04-08 08:38:23,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {78581#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {78581#true} is VALID [2022-04-08 08:38:23,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {78581#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {78586#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:38:23,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {78586#(= |ssl3_connect_#t~mem89| (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)))} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,121 INFO L290 TraceCheckUtils]: 55: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,122 INFO L290 TraceCheckUtils]: 56: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,122 INFO L290 TraceCheckUtils]: 57: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,122 INFO L290 TraceCheckUtils]: 58: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,123 INFO L290 TraceCheckUtils]: 59: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,124 INFO L290 TraceCheckUtils]: 60: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,124 INFO L290 TraceCheckUtils]: 61: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,125 INFO L290 TraceCheckUtils]: 62: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,125 INFO L290 TraceCheckUtils]: 63: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,125 INFO L290 TraceCheckUtils]: 64: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,126 INFO L290 TraceCheckUtils]: 65: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,126 INFO L290 TraceCheckUtils]: 66: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,126 INFO L290 TraceCheckUtils]: 67: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,127 INFO L290 TraceCheckUtils]: 69: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,127 INFO L290 TraceCheckUtils]: 70: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4400 == #t~mem52;havoc #t~mem52; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,127 INFO L290 TraceCheckUtils]: 71: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,128 INFO L290 TraceCheckUtils]: 72: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,128 INFO L290 TraceCheckUtils]: 74: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,130 INFO L290 TraceCheckUtils]: 75: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,131 INFO L290 TraceCheckUtils]: 76: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,131 INFO L290 TraceCheckUtils]: 77: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,132 INFO L290 TraceCheckUtils]: 78: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,132 INFO L290 TraceCheckUtils]: 79: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,132 INFO L290 TraceCheckUtils]: 80: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,133 INFO L290 TraceCheckUtils]: 81: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,133 INFO L290 TraceCheckUtils]: 82: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,133 INFO L290 TraceCheckUtils]: 83: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,134 INFO L290 TraceCheckUtils]: 84: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,134 INFO L290 TraceCheckUtils]: 85: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,135 INFO L290 TraceCheckUtils]: 86: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,135 INFO L290 TraceCheckUtils]: 87: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,135 INFO L290 TraceCheckUtils]: 88: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,136 INFO L290 TraceCheckUtils]: 89: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,136 INFO L290 TraceCheckUtils]: 90: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,136 INFO L290 TraceCheckUtils]: 91: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,136 INFO L290 TraceCheckUtils]: 92: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4416 == #t~mem54;havoc #t~mem54; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,147 INFO L290 TraceCheckUtils]: 93: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,148 INFO L290 TraceCheckUtils]: 94: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,149 INFO L290 TraceCheckUtils]: 95: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} 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; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,150 INFO L290 TraceCheckUtils]: 96: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == ~tmp___6~0); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,150 INFO L290 TraceCheckUtils]: 97: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,151 INFO L290 TraceCheckUtils]: 98: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,151 INFO L290 TraceCheckUtils]: 99: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} ~skip~0 := 0; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,151 INFO L290 TraceCheckUtils]: 100: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !false; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,152 INFO L290 TraceCheckUtils]: 101: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 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); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,152 INFO L290 TraceCheckUtils]: 102: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,153 INFO L290 TraceCheckUtils]: 103: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,153 INFO L290 TraceCheckUtils]: 104: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,153 INFO L290 TraceCheckUtils]: 105: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,154 INFO L290 TraceCheckUtils]: 106: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,154 INFO L290 TraceCheckUtils]: 107: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,154 INFO L290 TraceCheckUtils]: 108: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,155 INFO L290 TraceCheckUtils]: 109: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,155 INFO L290 TraceCheckUtils]: 110: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume 4385 == #t~mem51;havoc #t~mem51; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,155 INFO L290 TraceCheckUtils]: 111: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,156 INFO L290 TraceCheckUtils]: 112: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(1 == ~blastFlag~0); {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} is VALID [2022-04-08 08:38:23,156 INFO L290 TraceCheckUtils]: 113: Hoare triple {78587#(= (select (select |#memory_int| ssl3_connect_~s.base) (+ 92 ssl3_connect_~s.offset)) 0)} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {78588#(= |ssl3_connect_#t~mem89| 0)} is VALID [2022-04-08 08:38:23,156 INFO L290 TraceCheckUtils]: 114: Hoare triple {78588#(= |ssl3_connect_#t~mem89| 0)} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,157 INFO L290 TraceCheckUtils]: 115: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,157 INFO L290 TraceCheckUtils]: 116: Hoare triple {78582#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); {78582#false} is VALID [2022-04-08 08:38:23,157 INFO L290 TraceCheckUtils]: 117: Hoare triple {78582#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78582#false} is VALID [2022-04-08 08:38:23,157 INFO L290 TraceCheckUtils]: 118: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-08 08:38:23,159 INFO L290 TraceCheckUtils]: 119: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-08 08:38:23,160 INFO L290 TraceCheckUtils]: 120: Hoare triple {78582#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); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 121: Hoare triple {78582#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 122: Hoare triple {78582#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 123: Hoare triple {78582#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 124: Hoare triple {78582#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 125: Hoare triple {78582#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 126: Hoare triple {78582#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 127: Hoare triple {78582#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 128: Hoare triple {78582#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 129: Hoare triple {78582#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,161 INFO L290 TraceCheckUtils]: 130: Hoare triple {78582#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 131: Hoare triple {78582#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 132: Hoare triple {78582#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 133: Hoare triple {78582#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 134: Hoare triple {78582#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 135: Hoare triple {78582#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 136: Hoare triple {78582#false} assume 4448 == #t~mem58;havoc #t~mem58; {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 137: Hoare triple {78582#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 138: Hoare triple {78582#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 139: Hoare triple {78582#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 140: Hoare triple {78582#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,162 INFO L290 TraceCheckUtils]: 141: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,163 INFO L290 TraceCheckUtils]: 142: Hoare triple {78582#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); {78582#false} is VALID [2022-04-08 08:38:23,163 INFO L290 TraceCheckUtils]: 143: Hoare triple {78582#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78582#false} is VALID [2022-04-08 08:38:23,163 INFO L290 TraceCheckUtils]: 144: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-08 08:38:23,163 INFO L290 TraceCheckUtils]: 145: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-08 08:38:23,163 INFO L290 TraceCheckUtils]: 146: Hoare triple {78582#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); {78582#false} is VALID [2022-04-08 08:38:23,163 INFO L290 TraceCheckUtils]: 147: Hoare triple {78582#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,163 INFO L290 TraceCheckUtils]: 148: Hoare triple {78582#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,163 INFO L290 TraceCheckUtils]: 149: Hoare triple {78582#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,163 INFO L290 TraceCheckUtils]: 150: Hoare triple {78582#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 151: Hoare triple {78582#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 152: Hoare triple {78582#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 153: Hoare triple {78582#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 154: Hoare triple {78582#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 155: Hoare triple {78582#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 156: Hoare triple {78582#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 157: Hoare triple {78582#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 158: Hoare triple {78582#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 159: Hoare triple {78582#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 160: Hoare triple {78582#false} assume 4432 == #t~mem56;havoc #t~mem56; {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 161: Hoare triple {78582#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {78582#false} is VALID [2022-04-08 08:38:23,164 INFO L290 TraceCheckUtils]: 162: Hoare triple {78582#false} assume 5 == ~blastFlag~0; {78582#false} is VALID [2022-04-08 08:38:23,165 INFO L290 TraceCheckUtils]: 163: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-08 08:38:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 231 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-08 08:38:23,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:38:23,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041607903] [2022-04-08 08:38:23,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041607903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 08:38:23,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331762401] [2022-04-08 08:38:23,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:38:23,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:38:23,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:38:23,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 08:38:23,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 08:40:02,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:40:02,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:40:02,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 08:40:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:02,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:40:02,481 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-04-08 08:40:02,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-04-08 08:40:02,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-04-08 08:40:02,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {78581#true} call ULTIMATE.init(); {78581#true} is VALID [2022-04-08 08:40:02,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {78581#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(27, 2);call #Ultimate.allocInit(12, 3);~init~0 := 1;~#SSLv3_client_data~0.base, ~#SSLv3_client_data~0.offset := 4, 0;call #Ultimate.allocInit(100, 4);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#SSLv3_client_data~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {78581#true} is VALID [2022-04-08 08:40:02,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {78581#true} assume true; {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78581#true} {78581#true} #592#return; {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {78581#true} call #t~ret159 := main(); {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {78581#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {78581#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {78581#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L290 TraceCheckUtils]: 10: Hoare triple {78581#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-08 08:40:02,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {78581#true} assume 12292 == #t~mem43;havoc #t~mem43; {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {78581#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {78581#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {78581#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {78581#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {78581#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {78581#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {78581#true} is VALID [2022-04-08 08:40:02,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 27: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 28: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 31: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,659 INFO L290 TraceCheckUtils]: 32: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {78581#true} assume 4368 == #t~mem48;havoc #t~mem48; {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {78581#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 44: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 45: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 46: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {78581#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {78581#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 50: Hoare triple {78581#true} assume 4384 == #t~mem50;havoc #t~mem50; {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {78581#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {78581#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 53: Hoare triple {78581#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,661 INFO L290 TraceCheckUtils]: 54: Hoare triple {78581#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 55: Hoare triple {78581#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 56: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 58: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 59: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 60: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 61: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 62: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 63: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 65: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {78581#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 67: Hoare triple {78581#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 68: Hoare triple {78581#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 69: Hoare triple {78581#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 70: Hoare triple {78581#true} assume 4400 == #t~mem52;havoc #t~mem52; {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 71: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 72: Hoare triple {78581#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; {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {78581#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 74: Hoare triple {78581#true} assume !(~ret~0 <= 0); {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 75: Hoare triple {78581#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,663 INFO L290 TraceCheckUtils]: 76: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 77: Hoare triple {78581#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 78: Hoare triple {78581#true} ~skip~0 := 0; {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 79: Hoare triple {78581#true} assume !false; {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 80: Hoare triple {78581#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); {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 81: Hoare triple {78581#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 82: Hoare triple {78581#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 83: Hoare triple {78581#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 84: Hoare triple {78581#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 85: Hoare triple {78581#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 86: Hoare triple {78581#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,664 INFO L290 TraceCheckUtils]: 87: Hoare triple {78581#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,665 INFO L290 TraceCheckUtils]: 88: Hoare triple {78581#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,665 INFO L290 TraceCheckUtils]: 89: Hoare triple {78581#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,665 INFO L290 TraceCheckUtils]: 90: Hoare triple {78581#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,665 INFO L290 TraceCheckUtils]: 91: Hoare triple {78581#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78581#true} is VALID [2022-04-08 08:40:02,665 INFO L290 TraceCheckUtils]: 92: Hoare triple {78581#true} assume 4416 == #t~mem54;havoc #t~mem54; {78581#true} is VALID [2022-04-08 08:40:02,665 INFO L290 TraceCheckUtils]: 93: Hoare triple {78581#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {78581#true} is VALID [2022-04-08 08:40:02,665 INFO L290 TraceCheckUtils]: 94: Hoare triple {78581#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {78581#true} is VALID [2022-04-08 08:40:02,671 INFO L290 TraceCheckUtils]: 95: Hoare triple {78581#true} 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; {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,671 INFO L290 TraceCheckUtils]: 96: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,672 INFO L290 TraceCheckUtils]: 97: Hoare triple {78878#(= 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); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,672 INFO L290 TraceCheckUtils]: 98: Hoare triple {78878#(= 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; {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,672 INFO L290 TraceCheckUtils]: 99: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,673 INFO L290 TraceCheckUtils]: 100: Hoare triple {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,673 INFO L290 TraceCheckUtils]: 101: Hoare triple {78878#(= 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); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,673 INFO L290 TraceCheckUtils]: 102: Hoare triple {78878#(= 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); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,674 INFO L290 TraceCheckUtils]: 103: Hoare triple {78878#(= 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); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,674 INFO L290 TraceCheckUtils]: 104: Hoare triple {78878#(= 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); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,674 INFO L290 TraceCheckUtils]: 105: Hoare triple {78878#(= 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); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,675 INFO L290 TraceCheckUtils]: 106: Hoare triple {78878#(= 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); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,675 INFO L290 TraceCheckUtils]: 107: Hoare triple {78878#(= 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); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,675 INFO L290 TraceCheckUtils]: 108: Hoare triple {78878#(= 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); {78878#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:02,676 INFO L290 TraceCheckUtils]: 109: Hoare triple {78878#(= 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); {78921#(= |ssl3_connect_#t~mem51| 4432)} is VALID [2022-04-08 08:40:02,676 INFO L290 TraceCheckUtils]: 110: Hoare triple {78921#(= |ssl3_connect_#t~mem51| 4432)} assume 4385 == #t~mem51;havoc #t~mem51; {78582#false} is VALID [2022-04-08 08:40:02,676 INFO L290 TraceCheckUtils]: 111: Hoare triple {78582#false} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {78582#false} is VALID [2022-04-08 08:40:02,676 INFO L290 TraceCheckUtils]: 112: Hoare triple {78582#false} assume !(1 == ~blastFlag~0); {78582#false} is VALID [2022-04-08 08:40:02,676 INFO L290 TraceCheckUtils]: 113: Hoare triple {78582#false} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,676 INFO L290 TraceCheckUtils]: 114: Hoare triple {78582#false} assume 0 != #t~mem89;havoc #t~mem89;call write~int(4560, ~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,676 INFO L290 TraceCheckUtils]: 115: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,676 INFO L290 TraceCheckUtils]: 116: Hoare triple {78582#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); {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 117: Hoare triple {78582#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 118: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 119: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 120: Hoare triple {78582#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); {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 121: Hoare triple {78582#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 122: Hoare triple {78582#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 123: Hoare triple {78582#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 124: Hoare triple {78582#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 125: Hoare triple {78582#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 126: Hoare triple {78582#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 127: Hoare triple {78582#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,677 INFO L290 TraceCheckUtils]: 128: Hoare triple {78582#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 129: Hoare triple {78582#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 130: Hoare triple {78582#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 131: Hoare triple {78582#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 132: Hoare triple {78582#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 133: Hoare triple {78582#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 134: Hoare triple {78582#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 135: Hoare triple {78582#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 136: Hoare triple {78582#false} assume 4448 == #t~mem58;havoc #t~mem58; {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 137: Hoare triple {78582#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 138: Hoare triple {78582#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {78582#false} is VALID [2022-04-08 08:40:02,678 INFO L290 TraceCheckUtils]: 139: Hoare triple {78582#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 140: Hoare triple {78582#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 141: Hoare triple {78582#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 142: Hoare triple {78582#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); {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 143: Hoare triple {78582#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 144: Hoare triple {78582#false} ~skip~0 := 0; {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 145: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 146: Hoare triple {78582#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); {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 147: Hoare triple {78582#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 148: Hoare triple {78582#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 149: Hoare triple {78582#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 150: Hoare triple {78582#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,679 INFO L290 TraceCheckUtils]: 151: Hoare triple {78582#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 152: Hoare triple {78582#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 153: Hoare triple {78582#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 154: Hoare triple {78582#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 155: Hoare triple {78582#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 156: Hoare triple {78582#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 157: Hoare triple {78582#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 158: Hoare triple {78582#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 159: Hoare triple {78582#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 160: Hoare triple {78582#false} assume 4432 == #t~mem56;havoc #t~mem56; {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 161: Hoare triple {78582#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 162: Hoare triple {78582#false} assume 5 == ~blastFlag~0; {78582#false} is VALID [2022-04-08 08:40:02,680 INFO L290 TraceCheckUtils]: 163: Hoare triple {78582#false} assume !false; {78582#false} is VALID [2022-04-08 08:40:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 08:40:02,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:40:02,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331762401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:02,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 08:40:02,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-04-08 08:40:02,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1056774716] [2022-04-08 08:40:02,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1056774716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:02,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:02,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:40:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227575880] [2022-04-08 08:40:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:02,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 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 164 [2022-04-08 08:40:02,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:02,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:02,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:02,774 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:40:02,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:02,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:40:02,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 08:40:02,775 INFO L87 Difference]: Start difference. First operand 907 states and 1314 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:08,854 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:09,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:09,709 INFO L93 Difference]: Finished difference Result 1857 states and 2674 transitions. [2022-04-08 08:40:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:40:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 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 164 [2022-04-08 08:40:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-04-08 08:40:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-04-08 08:40:09,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 392 transitions. [2022-04-08 08:40:09,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:10,017 INFO L225 Difference]: With dead ends: 1857 [2022-04-08 08:40:10,017 INFO L226 Difference]: Without dead ends: 966 [2022-04-08 08:40:10,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-08 08:40:10,020 INFO L913 BasicCegarLoop]: 207 mSDtfsCounter, 35 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:10,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 503 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 135 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 08:40:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-04-08 08:40:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 907. [2022-04-08 08:40:10,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:10,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 966 states. Second operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:10,073 INFO L74 IsIncluded]: Start isIncluded. First operand 966 states. Second operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:10,074 INFO L87 Difference]: Start difference. First operand 966 states. Second operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:10,120 INFO L93 Difference]: Finished difference Result 966 states and 1376 transitions. [2022-04-08 08:40:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1376 transitions. [2022-04-08 08:40:10,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:10,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:10,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 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 966 states. [2022-04-08 08:40:10,123 INFO L87 Difference]: Start difference. First operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 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 966 states. [2022-04-08 08:40:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:10,169 INFO L93 Difference]: Finished difference Result 966 states and 1376 transitions. [2022-04-08 08:40:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1376 transitions. [2022-04-08 08:40:10,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:10,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:10,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:10,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 902 states have (on average 1.4478935698447895) internal successors, (1306), 902 states have internal predecessors, (1306), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1310 transitions. [2022-04-08 08:40:10,234 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1310 transitions. Word has length 164 [2022-04-08 08:40:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:10,235 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1310 transitions. [2022-04-08 08:40:10,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:10,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1310 transitions. [2022-04-08 08:40:11,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1310 edges. 1310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1310 transitions. [2022-04-08 08:40:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-08 08:40:11,458 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:11,458 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:40:11,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 08:40:11,658 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:40:11,659 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:11,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:11,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1024644139, now seen corresponding path program 1 times [2022-04-08 08:40:11,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:11,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2070318691] [2022-04-08 08:40:25,519 WARN L232 SmtUtils]: Spent 13.86s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:40:37,208 WARN L232 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:40:44,248 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1024644139, now seen corresponding path program 2 times [2022-04-08 08:40:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:44,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412563542] [2022-04-08 08:40:44,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:44,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {86552#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {86545#true} is VALID [2022-04-08 08:40:44,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {86545#true} assume true; {86545#true} is VALID [2022-04-08 08:40:44,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86545#true} {86545#true} #592#return; {86545#true} is VALID [2022-04-08 08:40:44,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {86545#true} call ULTIMATE.init(); {86552#(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-08 08:40:44,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {86552#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {86545#true} is VALID [2022-04-08 08:40:44,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {86545#true} assume true; {86545#true} is VALID [2022-04-08 08:40:44,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86545#true} {86545#true} #592#return; {86545#true} is VALID [2022-04-08 08:40:44,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {86545#true} call #t~ret159 := main(); {86545#true} is VALID [2022-04-08 08:40:44,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {86545#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {86545#true} is VALID [2022-04-08 08:40:44,451 INFO L272 TraceCheckUtils]: 6: Hoare triple {86545#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {86545#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {86545#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; {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {86545#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; {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {86545#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {86545#true} assume 12292 == #t~mem43;havoc #t~mem43; {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {86545#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; {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {86545#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {86545#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {86545#true} is VALID [2022-04-08 08:40:44,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {86545#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {86545#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {86545#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {86545#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {86545#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {86545#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {86545#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {86545#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {86545#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {86545#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {86545#true} assume 4368 == #t~mem48;havoc #t~mem48; {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {86545#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; {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {86545#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {86545#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; {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {86545#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86545#true} is VALID [2022-04-08 08:40:44,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {86545#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {86545#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {86545#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 46: Hoare triple {86545#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 47: Hoare triple {86545#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 48: Hoare triple {86545#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {86545#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {86545#true} assume 4384 == #t~mem50;havoc #t~mem50; {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 51: Hoare triple {86545#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {86545#true} is VALID [2022-04-08 08:40:44,455 INFO L290 TraceCheckUtils]: 52: Hoare triple {86545#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 53: Hoare triple {86545#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 54: Hoare triple {86545#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {86545#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {86545#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 59: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 60: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 61: Hoare triple {86545#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 62: Hoare triple {86545#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 63: Hoare triple {86545#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {86545#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {86545#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {86545#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {86545#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {86545#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {86545#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {86545#true} assume 4400 == #t~mem52;havoc #t~mem52; {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 72: Hoare triple {86545#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; {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 73: Hoare triple {86545#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 74: Hoare triple {86545#true} assume !(~ret~0 <= 0); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 75: Hoare triple {86545#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 76: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,457 INFO L290 TraceCheckUtils]: 77: Hoare triple {86545#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 78: Hoare triple {86545#true} ~skip~0 := 0; {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 79: Hoare triple {86545#true} assume !false; {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 80: Hoare triple {86545#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); {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 81: Hoare triple {86545#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 82: Hoare triple {86545#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 83: Hoare triple {86545#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 84: Hoare triple {86545#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 85: Hoare triple {86545#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 86: Hoare triple {86545#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 87: Hoare triple {86545#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 88: Hoare triple {86545#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,458 INFO L290 TraceCheckUtils]: 89: Hoare triple {86545#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,459 INFO L290 TraceCheckUtils]: 90: Hoare triple {86545#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,459 INFO L290 TraceCheckUtils]: 91: Hoare triple {86545#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {86545#true} is VALID [2022-04-08 08:40:44,459 INFO L290 TraceCheckUtils]: 92: Hoare triple {86545#true} assume 4416 == #t~mem54;havoc #t~mem54; {86545#true} is VALID [2022-04-08 08:40:44,459 INFO L290 TraceCheckUtils]: 93: Hoare triple {86545#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {86545#true} is VALID [2022-04-08 08:40:44,459 INFO L290 TraceCheckUtils]: 94: Hoare triple {86545#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {86545#true} is VALID [2022-04-08 08:40:44,460 INFO L290 TraceCheckUtils]: 95: Hoare triple {86545#true} 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; {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,461 INFO L290 TraceCheckUtils]: 96: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !(0 == ~tmp___6~0); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,461 INFO L290 TraceCheckUtils]: 97: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,461 INFO L290 TraceCheckUtils]: 98: Hoare triple {86550#(= 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; {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,461 INFO L290 TraceCheckUtils]: 99: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,462 INFO L290 TraceCheckUtils]: 100: Hoare triple {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,462 INFO L290 TraceCheckUtils]: 101: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,462 INFO L290 TraceCheckUtils]: 102: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,463 INFO L290 TraceCheckUtils]: 103: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,463 INFO L290 TraceCheckUtils]: 104: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,463 INFO L290 TraceCheckUtils]: 105: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,464 INFO L290 TraceCheckUtils]: 106: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,464 INFO L290 TraceCheckUtils]: 107: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,464 INFO L290 TraceCheckUtils]: 108: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,465 INFO L290 TraceCheckUtils]: 109: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,465 INFO L290 TraceCheckUtils]: 110: Hoare triple {86550#(= 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); {86550#(= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:40:44,465 INFO L290 TraceCheckUtils]: 111: Hoare triple {86550#(= 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); {86551#(= |ssl3_connect_#t~mem53| 4432)} is VALID [2022-04-08 08:40:44,466 INFO L290 TraceCheckUtils]: 112: Hoare triple {86551#(= |ssl3_connect_#t~mem53| 4432)} assume 4401 == #t~mem53;havoc #t~mem53; {86546#false} is VALID [2022-04-08 08:40:44,466 INFO L290 TraceCheckUtils]: 113: Hoare triple {86546#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); {86546#false} is VALID [2022-04-08 08:40:44,466 INFO L290 TraceCheckUtils]: 114: Hoare triple {86546#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;~skip~0 := 1; {86546#false} is VALID [2022-04-08 08:40:44,466 INFO L290 TraceCheckUtils]: 115: Hoare triple {86546#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,466 INFO L290 TraceCheckUtils]: 116: Hoare triple {86546#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); {86546#false} is VALID [2022-04-08 08:40:44,466 INFO L290 TraceCheckUtils]: 117: Hoare triple {86546#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86546#false} is VALID [2022-04-08 08:40:44,466 INFO L290 TraceCheckUtils]: 118: Hoare triple {86546#false} ~skip~0 := 0; {86546#false} is VALID [2022-04-08 08:40:44,466 INFO L290 TraceCheckUtils]: 119: Hoare triple {86546#false} assume !false; {86546#false} is VALID [2022-04-08 08:40:44,466 INFO L290 TraceCheckUtils]: 120: Hoare triple {86546#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); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 121: Hoare triple {86546#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 122: Hoare triple {86546#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 123: Hoare triple {86546#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 124: Hoare triple {86546#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 125: Hoare triple {86546#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 126: Hoare triple {86546#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 127: Hoare triple {86546#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 128: Hoare triple {86546#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 129: Hoare triple {86546#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 130: Hoare triple {86546#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 131: Hoare triple {86546#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,467 INFO L290 TraceCheckUtils]: 132: Hoare triple {86546#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 133: Hoare triple {86546#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 134: Hoare triple {86546#false} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 135: Hoare triple {86546#false} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 136: Hoare triple {86546#false} assume 4448 == #t~mem58;havoc #t~mem58; {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 137: Hoare triple {86546#false} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 138: Hoare triple {86546#false} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 139: Hoare triple {86546#false} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 140: Hoare triple {86546#false} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 141: Hoare triple {86546#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 142: Hoare triple {86546#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); {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 143: Hoare triple {86546#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {86546#false} is VALID [2022-04-08 08:40:44,468 INFO L290 TraceCheckUtils]: 144: Hoare triple {86546#false} ~skip~0 := 0; {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 145: Hoare triple {86546#false} assume !false; {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 146: Hoare triple {86546#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); {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 147: Hoare triple {86546#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 148: Hoare triple {86546#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 149: Hoare triple {86546#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 150: Hoare triple {86546#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 151: Hoare triple {86546#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 152: Hoare triple {86546#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 153: Hoare triple {86546#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 154: Hoare triple {86546#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,469 INFO L290 TraceCheckUtils]: 155: Hoare triple {86546#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,470 INFO L290 TraceCheckUtils]: 156: Hoare triple {86546#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,470 INFO L290 TraceCheckUtils]: 157: Hoare triple {86546#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,470 INFO L290 TraceCheckUtils]: 158: Hoare triple {86546#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,470 INFO L290 TraceCheckUtils]: 159: Hoare triple {86546#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {86546#false} is VALID [2022-04-08 08:40:44,470 INFO L290 TraceCheckUtils]: 160: Hoare triple {86546#false} assume 4432 == #t~mem56;havoc #t~mem56; {86546#false} is VALID [2022-04-08 08:40:44,470 INFO L290 TraceCheckUtils]: 161: Hoare triple {86546#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {86546#false} is VALID [2022-04-08 08:40:44,470 INFO L290 TraceCheckUtils]: 162: Hoare triple {86546#false} assume 5 == ~blastFlag~0; {86546#false} is VALID [2022-04-08 08:40:44,470 INFO L290 TraceCheckUtils]: 163: Hoare triple {86546#false} assume !false; {86546#false} is VALID [2022-04-08 08:40:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-08 08:40:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412563542] [2022-04-08 08:40:44,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412563542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:44,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:44,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:44,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:44,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2070318691] [2022-04-08 08:40:44,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2070318691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:44,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:44,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359860585] [2022-04-08 08:40:44,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 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 164 [2022-04-08 08:40:44,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:44,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:44,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:44,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:44,550 INFO L87 Difference]: Start difference. First operand 907 states and 1310 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:46,572 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:47,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:47,873 INFO L93 Difference]: Finished difference Result 1836 states and 2640 transitions. [2022-04-08 08:40:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 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 164 [2022-04-08 08:40:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:47,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:47,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-08 08:40:47,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:47,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 384 transitions. [2022-04-08 08:40:47,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 384 transitions. [2022-04-08 08:40:48,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:48,181 INFO L225 Difference]: With dead ends: 1836 [2022-04-08 08:40:48,181 INFO L226 Difference]: Without dead ends: 945 [2022-04-08 08:40:48,182 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:48,183 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 26 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:40:48,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 487 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 351 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:40:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2022-04-08 08:40:48,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 907. [2022-04-08 08:40:48,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:48,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 945 states. Second operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,243 INFO L74 IsIncluded]: Start isIncluded. First operand 945 states. Second operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,244 INFO L87 Difference]: Start difference. First operand 945 states. Second operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:48,289 INFO L93 Difference]: Finished difference Result 945 states and 1346 transitions. [2022-04-08 08:40:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1346 transitions. [2022-04-08 08:40:48,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:48,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:48,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 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 945 states. [2022-04-08 08:40:48,294 INFO L87 Difference]: Start difference. First operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 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 945 states. [2022-04-08 08:40:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:48,336 INFO L93 Difference]: Finished difference Result 945 states and 1346 transitions. [2022-04-08 08:40:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1346 transitions. [2022-04-08 08:40:48,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:48,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:48,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:48,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 902 states have (on average 1.4434589800443458) internal successors, (1302), 902 states have internal predecessors, (1302), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1306 transitions. [2022-04-08 08:40:48,392 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1306 transitions. Word has length 164 [2022-04-08 08:40:48,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:48,393 INFO L478 AbstractCegarLoop]: Abstraction has 907 states and 1306 transitions. [2022-04-08 08:40:48,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:48,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 907 states and 1306 transitions. [2022-04-08 08:40:49,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1306 edges. 1306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1306 transitions. [2022-04-08 08:40:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-08 08:40:49,585 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:49,586 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1] [2022-04-08 08:40:49,586 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:40:49,586 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:49,586 INFO L85 PathProgramCache]: Analyzing trace with hash -225241884, now seen corresponding path program 1 times [2022-04-08 08:40:49,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:49,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1021891787] [2022-04-08 08:40:49,588 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:49,588 INFO L85 PathProgramCache]: Analyzing trace with hash -225241884, now seen corresponding path program 2 times [2022-04-08 08:40:49,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:49,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170417035] [2022-04-08 08:40:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:49,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:49,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {93940#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {93933#true} is VALID [2022-04-08 08:40:49,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {93933#true} assume true; {93933#true} is VALID [2022-04-08 08:40:49,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93933#true} {93933#true} #592#return; {93933#true} is VALID [2022-04-08 08:40:49,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {93933#true} call ULTIMATE.init(); {93940#(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-08 08:40:49,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {93940#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {93933#true} is VALID [2022-04-08 08:40:49,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {93933#true} assume true; {93933#true} is VALID [2022-04-08 08:40:49,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93933#true} {93933#true} #592#return; {93933#true} is VALID [2022-04-08 08:40:49,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {93933#true} call #t~ret159 := main(); {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {93933#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {93933#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {93933#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {93933#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; {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {93933#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; {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {93933#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {93933#true} assume 12292 == #t~mem43;havoc #t~mem43; {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {93933#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; {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {93933#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {93933#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {93933#true} is VALID [2022-04-08 08:40:49,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {93933#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {93933#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {93933#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {93933#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {93933#true} assume 4368 == #t~mem48;havoc #t~mem48; {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {93933#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; {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {93933#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {93933#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; {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,854 INFO L290 TraceCheckUtils]: 45: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 48: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {93933#true} assume 4384 == #t~mem50;havoc #t~mem50; {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {93933#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {93933#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {93933#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {93933#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 55: Hoare triple {93933#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 56: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-08 08:40:49,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 59: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 63: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 64: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 67: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 68: Hoare triple {93933#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 69: Hoare triple {93933#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 70: Hoare triple {93933#true} assume 4400 == #t~mem52;havoc #t~mem52; {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 71: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,856 INFO L290 TraceCheckUtils]: 72: Hoare triple {93933#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; {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 73: Hoare triple {93933#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 74: Hoare triple {93933#true} assume !(~ret~0 <= 0); {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 75: Hoare triple {93933#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 76: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 81: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 82: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 83: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,857 INFO L290 TraceCheckUtils]: 86: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 87: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 88: Hoare triple {93933#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {93933#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 90: Hoare triple {93933#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 91: Hoare triple {93933#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 92: Hoare triple {93933#true} assume 4416 == #t~mem54;havoc #t~mem54; {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 93: Hoare triple {93933#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 94: Hoare triple {93933#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 95: Hoare triple {93933#true} 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; {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 96: Hoare triple {93933#true} assume !(0 == ~tmp___6~0); {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 97: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 98: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 99: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-08 08:40:49,858 INFO L290 TraceCheckUtils]: 100: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 101: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 102: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 103: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 104: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 105: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 106: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 107: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 108: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 109: Hoare triple {93933#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 110: Hoare triple {93933#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 111: Hoare triple {93933#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 112: Hoare triple {93933#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,859 INFO L290 TraceCheckUtils]: 113: Hoare triple {93933#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 114: Hoare triple {93933#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 115: Hoare triple {93933#true} assume 4432 == #t~mem56;havoc #t~mem56; {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 116: Hoare triple {93933#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 117: Hoare triple {93933#true} assume !(5 == ~blastFlag~0); {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 118: Hoare triple {93933#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 119: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 120: Hoare triple {93933#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 121: Hoare triple {93933#true} ~skip~0 := 0; {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 122: Hoare triple {93933#true} assume !false; {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 123: Hoare triple {93933#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); {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 124: Hoare triple {93933#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 125: Hoare triple {93933#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,860 INFO L290 TraceCheckUtils]: 126: Hoare triple {93933#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 127: Hoare triple {93933#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 128: Hoare triple {93933#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 129: Hoare triple {93933#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 130: Hoare triple {93933#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 131: Hoare triple {93933#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 132: Hoare triple {93933#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 133: Hoare triple {93933#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 134: Hoare triple {93933#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 135: Hoare triple {93933#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 136: Hoare triple {93933#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 137: Hoare triple {93933#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 138: Hoare triple {93933#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 139: Hoare triple {93933#true} assume 4448 == #t~mem58;havoc #t~mem58; {93933#true} is VALID [2022-04-08 08:40:49,861 INFO L290 TraceCheckUtils]: 140: Hoare triple {93933#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {93933#true} is VALID [2022-04-08 08:40:49,862 INFO L290 TraceCheckUtils]: 141: Hoare triple {93933#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {93933#true} is VALID [2022-04-08 08:40:49,862 INFO L290 TraceCheckUtils]: 142: Hoare triple {93933#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {93933#true} is VALID [2022-04-08 08:40:49,862 INFO L290 TraceCheckUtils]: 143: Hoare triple {93933#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,863 INFO L290 TraceCheckUtils]: 144: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,864 INFO L290 TraceCheckUtils]: 145: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,864 INFO L290 TraceCheckUtils]: 146: Hoare triple {93938#(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; {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,864 INFO L290 TraceCheckUtils]: 147: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,865 INFO L290 TraceCheckUtils]: 148: Hoare triple {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,865 INFO L290 TraceCheckUtils]: 149: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,865 INFO L290 TraceCheckUtils]: 150: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,865 INFO L290 TraceCheckUtils]: 151: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,866 INFO L290 TraceCheckUtils]: 152: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,866 INFO L290 TraceCheckUtils]: 153: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,866 INFO L290 TraceCheckUtils]: 154: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,867 INFO L290 TraceCheckUtils]: 155: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,867 INFO L290 TraceCheckUtils]: 156: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,867 INFO L290 TraceCheckUtils]: 157: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,867 INFO L290 TraceCheckUtils]: 158: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,868 INFO L290 TraceCheckUtils]: 159: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,868 INFO L290 TraceCheckUtils]: 160: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,868 INFO L290 TraceCheckUtils]: 161: Hoare triple {93938#(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); {93938#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:49,869 INFO L290 TraceCheckUtils]: 162: Hoare triple {93938#(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); {93939#(not (= |ssl3_connect_#t~mem56| 4432))} is VALID [2022-04-08 08:40:49,869 INFO L290 TraceCheckUtils]: 163: Hoare triple {93939#(not (= |ssl3_connect_#t~mem56| 4432))} assume 4432 == #t~mem56;havoc #t~mem56; {93934#false} is VALID [2022-04-08 08:40:49,869 INFO L290 TraceCheckUtils]: 164: Hoare triple {93934#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {93934#false} is VALID [2022-04-08 08:40:49,869 INFO L290 TraceCheckUtils]: 165: Hoare triple {93934#false} assume 5 == ~blastFlag~0; {93934#false} is VALID [2022-04-08 08:40:49,869 INFO L290 TraceCheckUtils]: 166: Hoare triple {93934#false} assume !false; {93934#false} is VALID [2022-04-08 08:40:49,870 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:40:49,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:49,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170417035] [2022-04-08 08:40:49,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170417035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:49,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:49,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:49,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:49,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1021891787] [2022-04-08 08:40:49,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1021891787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:49,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:49,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118260977] [2022-04-08 08:40:49,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:49,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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 167 [2022-04-08 08:40:49,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:49,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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-08 08:40:49,961 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-08 08:40:49,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:49,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:49,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:49,962 INFO L87 Difference]: Start difference. First operand 907 states and 1306 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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-08 08:40:51,991 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-08 08:40:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:53,309 INFO L93 Difference]: Finished difference Result 2177 states and 3145 transitions. [2022-04-08 08:40:53,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:53,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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 167 [2022-04-08 08:40:53,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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-08 08:40:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-08 08:40:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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-08 08:40:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-08 08:40:53,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-08 08:40:53,642 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-08 08:40:53,708 INFO L225 Difference]: With dead ends: 2177 [2022-04-08 08:40:53,708 INFO L226 Difference]: Without dead ends: 1286 [2022-04-08 08:40:53,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:53,710 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 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-08 08:40:53,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 285 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:40:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2022-04-08 08:40:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 952. [2022-04-08 08:40:53,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:53,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1286 states. Second operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 states have internal predecessors, (1387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:53,778 INFO L74 IsIncluded]: Start isIncluded. First operand 1286 states. Second operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 states have internal predecessors, (1387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:53,779 INFO L87 Difference]: Start difference. First operand 1286 states. Second operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 states have internal predecessors, (1387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:53,833 INFO L93 Difference]: Finished difference Result 1286 states and 1854 transitions. [2022-04-08 08:40:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1854 transitions. [2022-04-08 08:40:53,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:53,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:53,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 states have internal predecessors, (1387), 3 states have call successors, (3), 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 1286 states. [2022-04-08 08:40:53,836 INFO L87 Difference]: Start difference. First operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 states have internal predecessors, (1387), 3 states have call successors, (3), 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 1286 states. [2022-04-08 08:40:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:53,891 INFO L93 Difference]: Finished difference Result 1286 states and 1854 transitions. [2022-04-08 08:40:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1854 transitions. [2022-04-08 08:40:53,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:53,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:53,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:53,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 947 states have (on average 1.4646251319957762) internal successors, (1387), 947 states have internal predecessors, (1387), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1391 transitions. [2022-04-08 08:40:53,934 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1391 transitions. Word has length 167 [2022-04-08 08:40:53,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:53,934 INFO L478 AbstractCegarLoop]: Abstraction has 952 states and 1391 transitions. [2022-04-08 08:40:53,934 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 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-08 08:40:53,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 952 states and 1391 transitions. [2022-04-08 08:40:55,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1391 edges. 1391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:40:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1391 transitions. [2022-04-08 08:40:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-04-08 08:40:55,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:40:55,216 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1] [2022-04-08 08:40:55,216 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:40:55,216 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:40:55,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:40:55,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1603018293, now seen corresponding path program 1 times [2022-04-08 08:40:55,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:55,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704430552] [2022-04-08 08:40:55,217 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:40:55,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1603018293, now seen corresponding path program 2 times [2022-04-08 08:40:55,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:40:55,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000151824] [2022-04-08 08:40:55,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:40:55,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:40:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:55,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:40:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:40:55,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {102782#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {102775#true} is VALID [2022-04-08 08:40:55,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {102775#true} assume true; {102775#true} is VALID [2022-04-08 08:40:55,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {102775#true} {102775#true} #592#return; {102775#true} is VALID [2022-04-08 08:40:55,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {102775#true} call ULTIMATE.init(); {102782#(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-08 08:40:55,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {102782#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {102775#true} is VALID [2022-04-08 08:40:55,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {102775#true} assume true; {102775#true} is VALID [2022-04-08 08:40:55,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {102775#true} {102775#true} #592#return; {102775#true} is VALID [2022-04-08 08:40:55,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {102775#true} call #t~ret159 := main(); {102775#true} is VALID [2022-04-08 08:40:55,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {102775#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {102775#true} is VALID [2022-04-08 08:40:55,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {102775#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {102775#true} is VALID [2022-04-08 08:40:55,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {102775#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {102775#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; {102775#true} is VALID [2022-04-08 08:40:55,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {102775#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; {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {102775#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {102775#true} assume 12292 == #t~mem43;havoc #t~mem43; {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {102775#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; {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {102775#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {102775#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {102775#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {102775#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {102775#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {102775#true} is VALID [2022-04-08 08:40:55,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {102775#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,447 INFO L290 TraceCheckUtils]: 33: Hoare triple {102775#true} assume 4368 == #t~mem48;havoc #t~mem48; {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {102775#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; {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 35: Hoare triple {102775#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 37: Hoare triple {102775#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; {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 38: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 42: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 43: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,476 INFO L290 TraceCheckUtils]: 49: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 50: Hoare triple {102775#true} assume 4384 == #t~mem50;havoc #t~mem50; {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 51: Hoare triple {102775#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {102775#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {102775#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {102775#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 55: Hoare triple {102775#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 56: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 57: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 58: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 59: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 60: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 62: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 63: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 64: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 65: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 66: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {102775#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {102775#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 70: Hoare triple {102775#true} assume 4400 == #t~mem52;havoc #t~mem52; {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 72: Hoare triple {102775#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; {102775#true} is VALID [2022-04-08 08:40:55,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {102775#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {102775#true} assume !(~ret~0 <= 0); {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 75: Hoare triple {102775#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 78: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 79: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 80: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 81: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 82: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 83: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 84: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 85: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,479 INFO L290 TraceCheckUtils]: 86: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 87: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 88: Hoare triple {102775#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {102775#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 90: Hoare triple {102775#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 91: Hoare triple {102775#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 92: Hoare triple {102775#true} assume 4416 == #t~mem54;havoc #t~mem54; {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 93: Hoare triple {102775#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 94: Hoare triple {102775#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 95: Hoare triple {102775#true} 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; {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 96: Hoare triple {102775#true} assume !(0 == ~tmp___6~0); {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 97: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 98: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-08 08:40:55,480 INFO L290 TraceCheckUtils]: 99: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 100: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 101: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 102: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 103: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 104: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 105: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 107: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 108: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 109: Hoare triple {102775#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 110: Hoare triple {102775#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 111: Hoare triple {102775#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,481 INFO L290 TraceCheckUtils]: 112: Hoare triple {102775#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 113: Hoare triple {102775#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 114: Hoare triple {102775#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 115: Hoare triple {102775#true} assume 4432 == #t~mem56;havoc #t~mem56; {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 116: Hoare triple {102775#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 117: Hoare triple {102775#true} assume !(5 == ~blastFlag~0); {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 118: Hoare triple {102775#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 119: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 120: Hoare triple {102775#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 121: Hoare triple {102775#true} ~skip~0 := 0; {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 122: Hoare triple {102775#true} assume !false; {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 123: Hoare triple {102775#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); {102775#true} is VALID [2022-04-08 08:40:55,482 INFO L290 TraceCheckUtils]: 124: Hoare triple {102775#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 125: Hoare triple {102775#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 126: Hoare triple {102775#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 127: Hoare triple {102775#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 128: Hoare triple {102775#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 129: Hoare triple {102775#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 130: Hoare triple {102775#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 131: Hoare triple {102775#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 132: Hoare triple {102775#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 133: Hoare triple {102775#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 134: Hoare triple {102775#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 135: Hoare triple {102775#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,483 INFO L290 TraceCheckUtils]: 136: Hoare triple {102775#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,484 INFO L290 TraceCheckUtils]: 137: Hoare triple {102775#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,484 INFO L290 TraceCheckUtils]: 138: Hoare triple {102775#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,484 INFO L290 TraceCheckUtils]: 139: Hoare triple {102775#true} assume 4448 == #t~mem58;havoc #t~mem58; {102775#true} is VALID [2022-04-08 08:40:55,484 INFO L290 TraceCheckUtils]: 140: Hoare triple {102775#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {102775#true} is VALID [2022-04-08 08:40:55,484 INFO L290 TraceCheckUtils]: 141: Hoare triple {102775#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {102775#true} is VALID [2022-04-08 08:40:55,484 INFO L290 TraceCheckUtils]: 142: Hoare triple {102775#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {102775#true} is VALID [2022-04-08 08:40:55,486 INFO L290 TraceCheckUtils]: 143: Hoare triple {102775#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,486 INFO L290 TraceCheckUtils]: 144: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,487 INFO L290 TraceCheckUtils]: 145: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,487 INFO L290 TraceCheckUtils]: 146: Hoare triple {102780#(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; {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,488 INFO L290 TraceCheckUtils]: 147: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,488 INFO L290 TraceCheckUtils]: 148: Hoare triple {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,488 INFO L290 TraceCheckUtils]: 149: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,489 INFO L290 TraceCheckUtils]: 150: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,489 INFO L290 TraceCheckUtils]: 151: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,489 INFO L290 TraceCheckUtils]: 152: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,490 INFO L290 TraceCheckUtils]: 153: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,490 INFO L290 TraceCheckUtils]: 154: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,490 INFO L290 TraceCheckUtils]: 155: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,491 INFO L290 TraceCheckUtils]: 156: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,491 INFO L290 TraceCheckUtils]: 157: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,492 INFO L290 TraceCheckUtils]: 158: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,492 INFO L290 TraceCheckUtils]: 159: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,492 INFO L290 TraceCheckUtils]: 160: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,493 INFO L290 TraceCheckUtils]: 161: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,493 INFO L290 TraceCheckUtils]: 162: Hoare triple {102780#(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); {102780#(not (= 4433 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:40:55,494 INFO L290 TraceCheckUtils]: 163: Hoare triple {102780#(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); {102781#(not (= |ssl3_connect_#t~mem57| 4433))} is VALID [2022-04-08 08:40:55,494 INFO L290 TraceCheckUtils]: 164: Hoare triple {102781#(not (= |ssl3_connect_#t~mem57| 4433))} assume 4433 == #t~mem57;havoc #t~mem57; {102776#false} is VALID [2022-04-08 08:40:55,494 INFO L290 TraceCheckUtils]: 165: Hoare triple {102776#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {102776#false} is VALID [2022-04-08 08:40:55,494 INFO L290 TraceCheckUtils]: 166: Hoare triple {102776#false} assume 5 == ~blastFlag~0; {102776#false} is VALID [2022-04-08 08:40:55,494 INFO L290 TraceCheckUtils]: 167: Hoare triple {102776#false} assume !false; {102776#false} is VALID [2022-04-08 08:40:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:40:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:40:55,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000151824] [2022-04-08 08:40:55,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000151824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:55,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:55,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:55,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:40:55,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704430552] [2022-04-08 08:40:55,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704430552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:40:55,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:40:55,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:40:55,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096614107] [2022-04-08 08:40:55,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:40:55,496 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 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 168 [2022-04-08 08:40:55,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:40:55,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 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-08 08:40:55,572 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-08 08:40:55,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:40:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:40:55,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:40:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:40:55,573 INFO L87 Difference]: Start difference. First operand 952 states and 1391 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 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-08 08:40:57,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:40:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:58,879 INFO L93 Difference]: Finished difference Result 2219 states and 3222 transitions. [2022-04-08 08:40:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:40:58,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 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 168 [2022-04-08 08:40:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:40:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 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-08 08:40:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-08 08:40:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 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-08 08:40:58,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-08 08:40:58,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-08 08:40:59,206 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-08 08:40:59,269 INFO L225 Difference]: With dead ends: 2219 [2022-04-08 08:40:59,269 INFO L226 Difference]: Without dead ends: 1283 [2022-04-08 08:40:59,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:40:59,271 INFO L913 BasicCegarLoop]: 99 mSDtfsCounter, 105 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 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-08 08:40:59,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 284 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:40:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-04-08 08:40:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 957. [2022-04-08 08:40:59,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:40:59,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1283 states. Second operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:59,346 INFO L74 IsIncluded]: Start isIncluded. First operand 1283 states. Second operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:59,347 INFO L87 Difference]: Start difference. First operand 1283 states. Second operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:59,409 INFO L93 Difference]: Finished difference Result 1283 states and 1846 transitions. [2022-04-08 08:40:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1846 transitions. [2022-04-08 08:40:59,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:59,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:59,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 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 1283 states. [2022-04-08 08:40:59,412 INFO L87 Difference]: Start difference. First operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 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 1283 states. [2022-04-08 08:40:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:40:59,462 INFO L93 Difference]: Finished difference Result 1283 states and 1846 transitions. [2022-04-08 08:40:59,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1846 transitions. [2022-04-08 08:40:59,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:40:59,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:40:59,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:40:59,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:40:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 952 states have (on average 1.4621848739495797) internal successors, (1392), 952 states have internal predecessors, (1392), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:40:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1396 transitions. [2022-04-08 08:40:59,506 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1396 transitions. Word has length 168 [2022-04-08 08:40:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:40:59,506 INFO L478 AbstractCegarLoop]: Abstraction has 957 states and 1396 transitions. [2022-04-08 08:40:59,507 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 4 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-08 08:40:59,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 957 states and 1396 transitions. [2022-04-08 08:41:00,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1396 edges. 1396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1396 transitions. [2022-04-08 08:41:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-04-08 08:41:00,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:00,871 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:00,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:41:00,871 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:00,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:00,872 INFO L85 PathProgramCache]: Analyzing trace with hash 908405628, now seen corresponding path program 1 times [2022-04-08 08:41:00,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:00,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [523118879] [2022-04-08 08:41:15,184 WARN L232 SmtUtils]: Spent 13.89s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:41:26,889 WARN L232 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:41:33,963 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:41:33,964 INFO L85 PathProgramCache]: Analyzing trace with hash 908405628, now seen corresponding path program 2 times [2022-04-08 08:41:33,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:41:33,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420481288] [2022-04-08 08:41:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:41:33,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:41:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:34,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:41:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:41:34,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {111712#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {111705#true} is VALID [2022-04-08 08:41:34,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {111705#true} assume true; {111705#true} is VALID [2022-04-08 08:41:34,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111705#true} {111705#true} #592#return; {111705#true} is VALID [2022-04-08 08:41:34,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {111705#true} call ULTIMATE.init(); {111712#(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-08 08:41:34,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {111712#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {111705#true} is VALID [2022-04-08 08:41:34,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {111705#true} assume true; {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111705#true} {111705#true} #592#return; {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {111705#true} call #t~ret159 := main(); {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {111705#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L272 TraceCheckUtils]: 6: Hoare triple {111705#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {111705#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {111705#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; {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {111705#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; {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {111705#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {111705#true} assume 12292 == #t~mem43;havoc #t~mem43; {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {111705#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; {111705#true} is VALID [2022-04-08 08:41:34,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {111705#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {111705#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {111705#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {111705#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {111705#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {111705#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 31: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 32: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {111705#true} assume 4368 == #t~mem48;havoc #t~mem48; {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 34: Hoare triple {111705#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; {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {111705#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 36: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 37: Hoare triple {111705#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; {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-08 08:41:34,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 41: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {111705#true} assume 4384 == #t~mem50;havoc #t~mem50; {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {111705#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {111705#true} is VALID [2022-04-08 08:41:34,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {111705#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {111705#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {111705#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 55: Hoare triple {111705#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 57: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 58: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 59: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 60: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 61: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 62: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 63: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 64: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,216 INFO L290 TraceCheckUtils]: 65: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 66: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 67: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {111705#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {111705#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {111705#true} assume 4400 == #t~mem52;havoc #t~mem52; {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 72: Hoare triple {111705#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; {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 73: Hoare triple {111705#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 74: Hoare triple {111705#true} assume !(~ret~0 <= 0); {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 75: Hoare triple {111705#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 76: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 77: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 78: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-08 08:41:34,217 INFO L290 TraceCheckUtils]: 79: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 80: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 81: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 82: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 83: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 84: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 85: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 86: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 87: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 88: Hoare triple {111705#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 89: Hoare triple {111705#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 90: Hoare triple {111705#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,218 INFO L290 TraceCheckUtils]: 91: Hoare triple {111705#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 92: Hoare triple {111705#true} assume 4416 == #t~mem54;havoc #t~mem54; {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 93: Hoare triple {111705#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 94: Hoare triple {111705#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 95: Hoare triple {111705#true} 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; {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 96: Hoare triple {111705#true} assume !(0 == ~tmp___6~0); {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 97: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 98: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 99: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 100: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 101: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 102: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 103: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,219 INFO L290 TraceCheckUtils]: 104: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 105: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 106: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 107: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 108: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 109: Hoare triple {111705#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 110: Hoare triple {111705#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 111: Hoare triple {111705#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 112: Hoare triple {111705#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 113: Hoare triple {111705#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 114: Hoare triple {111705#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 115: Hoare triple {111705#true} assume 4432 == #t~mem56;havoc #t~mem56; {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 116: Hoare triple {111705#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {111705#true} is VALID [2022-04-08 08:41:34,220 INFO L290 TraceCheckUtils]: 117: Hoare triple {111705#true} assume !(5 == ~blastFlag~0); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 118: Hoare triple {111705#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 119: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 120: Hoare triple {111705#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 121: Hoare triple {111705#true} ~skip~0 := 0; {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 122: Hoare triple {111705#true} assume !false; {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 123: Hoare triple {111705#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); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 124: Hoare triple {111705#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 125: Hoare triple {111705#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 126: Hoare triple {111705#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 127: Hoare triple {111705#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 128: Hoare triple {111705#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 129: Hoare triple {111705#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,221 INFO L290 TraceCheckUtils]: 130: Hoare triple {111705#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 131: Hoare triple {111705#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 132: Hoare triple {111705#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 133: Hoare triple {111705#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 134: Hoare triple {111705#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 135: Hoare triple {111705#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 136: Hoare triple {111705#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 137: Hoare triple {111705#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 138: Hoare triple {111705#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 139: Hoare triple {111705#true} assume 4448 == #t~mem58;havoc #t~mem58; {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 140: Hoare triple {111705#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 141: Hoare triple {111705#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {111705#true} is VALID [2022-04-08 08:41:34,222 INFO L290 TraceCheckUtils]: 142: Hoare triple {111705#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {111705#true} is VALID [2022-04-08 08:41:34,223 INFO L290 TraceCheckUtils]: 143: Hoare triple {111705#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,224 INFO L290 TraceCheckUtils]: 144: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,224 INFO L290 TraceCheckUtils]: 145: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,225 INFO L290 TraceCheckUtils]: 146: Hoare triple {111710#(= 4464 (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; {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,225 INFO L290 TraceCheckUtils]: 147: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,225 INFO L290 TraceCheckUtils]: 148: Hoare triple {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,226 INFO L290 TraceCheckUtils]: 149: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,226 INFO L290 TraceCheckUtils]: 150: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,227 INFO L290 TraceCheckUtils]: 151: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,227 INFO L290 TraceCheckUtils]: 152: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,227 INFO L290 TraceCheckUtils]: 153: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,228 INFO L290 TraceCheckUtils]: 154: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,228 INFO L290 TraceCheckUtils]: 155: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,228 INFO L290 TraceCheckUtils]: 156: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,229 INFO L290 TraceCheckUtils]: 157: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,229 INFO L290 TraceCheckUtils]: 158: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,230 INFO L290 TraceCheckUtils]: 159: Hoare triple {111710#(= 4464 (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); {111710#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:41:34,230 INFO L290 TraceCheckUtils]: 160: Hoare triple {111710#(= 4464 (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); {111711#(= |ssl3_connect_#t~mem54| 4464)} is VALID [2022-04-08 08:41:34,230 INFO L290 TraceCheckUtils]: 161: Hoare triple {111711#(= |ssl3_connect_#t~mem54| 4464)} assume 4416 == #t~mem54;havoc #t~mem54; {111706#false} is VALID [2022-04-08 08:41:34,230 INFO L290 TraceCheckUtils]: 162: Hoare triple {111706#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 163: Hoare triple {111706#false} assume !(3 == ~blastFlag~0); {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 164: Hoare triple {111706#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; {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 165: Hoare triple {111706#false} assume !(0 == ~tmp___6~0); {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 166: Hoare triple {111706#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); {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 167: Hoare triple {111706#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 168: Hoare triple {111706#false} ~skip~0 := 0; {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 169: Hoare triple {111706#false} assume !false; {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 170: Hoare triple {111706#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); {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 171: Hoare triple {111706#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 172: Hoare triple {111706#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 173: Hoare triple {111706#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,231 INFO L290 TraceCheckUtils]: 174: Hoare triple {111706#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 175: Hoare triple {111706#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 176: Hoare triple {111706#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 177: Hoare triple {111706#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 178: Hoare triple {111706#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 179: Hoare triple {111706#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 180: Hoare triple {111706#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 181: Hoare triple {111706#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 182: Hoare triple {111706#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 183: Hoare triple {111706#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 184: Hoare triple {111706#false} assume 4432 == #t~mem56;havoc #t~mem56; {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 185: Hoare triple {111706#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {111706#false} is VALID [2022-04-08 08:41:34,232 INFO L290 TraceCheckUtils]: 186: Hoare triple {111706#false} assume 5 == ~blastFlag~0; {111706#false} is VALID [2022-04-08 08:41:34,233 INFO L290 TraceCheckUtils]: 187: Hoare triple {111706#false} assume !false; {111706#false} is VALID [2022-04-08 08:41:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:41:34,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:41:34,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420481288] [2022-04-08 08:41:34,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420481288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:34,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:34,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:34,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:41:34,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [523118879] [2022-04-08 08:41:34,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [523118879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:41:34,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:41:34,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:41:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256257738] [2022-04-08 08:41:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:41:34,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 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 188 [2022-04-08 08:41:34,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:41:34,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:34,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:34,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:41:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:34,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:41:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:41:34,328 INFO L87 Difference]: Start difference. First operand 957 states and 1396 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:36,356 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-08 08:41:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:38,001 INFO L93 Difference]: Finished difference Result 2253 states and 3280 transitions. [2022-04-08 08:41:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:41:38,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 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 188 [2022-04-08 08:41:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:41:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-08 08:41:38,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:38,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 468 transitions. [2022-04-08 08:41:38,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 468 transitions. [2022-04-08 08:41:38,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 468 edges. 468 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:38,385 INFO L225 Difference]: With dead ends: 2253 [2022-04-08 08:41:38,386 INFO L226 Difference]: Without dead ends: 1312 [2022-04-08 08:41:38,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:41:38,387 INFO L913 BasicCegarLoop]: 237 mSDtfsCounter, 89 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-08 08:41:38,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 566 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 536 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:41:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-04-08 08:41:38,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1049. [2022-04-08 08:41:38,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:41:38,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1312 states. Second operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:38,470 INFO L74 IsIncluded]: Start isIncluded. First operand 1312 states. Second operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:38,471 INFO L87 Difference]: Start difference. First operand 1312 states. Second operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:38,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:38,548 INFO L93 Difference]: Finished difference Result 1312 states and 1900 transitions. [2022-04-08 08:41:38,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1900 transitions. [2022-04-08 08:41:38,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:38,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:38,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 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 1312 states. [2022-04-08 08:41:38,551 INFO L87 Difference]: Start difference. First operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 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 1312 states. [2022-04-08 08:41:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:41:38,601 INFO L93 Difference]: Finished difference Result 1312 states and 1900 transitions. [2022-04-08 08:41:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1900 transitions. [2022-04-08 08:41:38,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:41:38,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:41:38,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:41:38,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:41:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 1044 states have (on average 1.4636015325670497) internal successors, (1528), 1044 states have internal predecessors, (1528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1532 transitions. [2022-04-08 08:41:38,664 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1532 transitions. Word has length 188 [2022-04-08 08:41:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:41:38,664 INFO L478 AbstractCegarLoop]: Abstraction has 1049 states and 1532 transitions. [2022-04-08 08:41:38,664 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:41:38,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1049 states and 1532 transitions. [2022-04-08 08:41:40,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1532 edges. 1532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:41:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1532 transitions. [2022-04-08 08:41:40,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-04-08 08:41:40,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:41:40,120 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:41:40,120 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-08 08:41:40,120 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:41:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:41:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1801891966, now seen corresponding path program 1 times [2022-04-08 08:41:40,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:41:40,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1450492896] [2022-04-08 08:41:52,696 WARN L232 SmtUtils]: Spent 12.14s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:42:01,517 WARN L232 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:42:08,683 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:08,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1801891966, now seen corresponding path program 2 times [2022-04-08 08:42:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:08,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554578737] [2022-04-08 08:42:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:08,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:08,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {120952#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {120945#true} is VALID [2022-04-08 08:42:08,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {120945#true} assume true; {120945#true} is VALID [2022-04-08 08:42:08,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {120945#true} {120945#true} #592#return; {120945#true} is VALID [2022-04-08 08:42:08,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {120945#true} call ULTIMATE.init(); {120952#(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-08 08:42:08,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {120952#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {120945#true} is VALID [2022-04-08 08:42:08,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {120945#true} assume true; {120945#true} is VALID [2022-04-08 08:42:08,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {120945#true} {120945#true} #592#return; {120945#true} is VALID [2022-04-08 08:42:08,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {120945#true} call #t~ret159 := main(); {120945#true} is VALID [2022-04-08 08:42:08,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {120945#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {120945#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {120945#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {120945#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; {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {120945#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; {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {120945#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {120945#true} assume 12292 == #t~mem43;havoc #t~mem43; {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {120945#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; {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {120945#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {120945#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {120945#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {120945#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {120945#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {120945#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 29: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 30: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 31: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,923 INFO L290 TraceCheckUtils]: 32: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {120945#true} assume 4368 == #t~mem48;havoc #t~mem48; {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 34: Hoare triple {120945#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; {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 35: Hoare triple {120945#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 36: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 37: Hoare triple {120945#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; {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 38: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 39: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 40: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 41: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 42: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 43: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 45: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 46: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 47: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 48: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 49: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 50: Hoare triple {120945#true} assume 4384 == #t~mem50;havoc #t~mem50; {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 51: Hoare triple {120945#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 52: Hoare triple {120945#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 53: Hoare triple {120945#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 54: Hoare triple {120945#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 55: Hoare triple {120945#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 56: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 57: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-08 08:42:08,925 INFO L290 TraceCheckUtils]: 58: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 59: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 60: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 61: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 62: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 64: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 65: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 66: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 67: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {120945#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 69: Hoare triple {120945#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 70: Hoare triple {120945#true} assume 4400 == #t~mem52;havoc #t~mem52; {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 71: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {120945#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; {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 73: Hoare triple {120945#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 74: Hoare triple {120945#true} assume !(~ret~0 <= 0); {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 75: Hoare triple {120945#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 77: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 78: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 79: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 80: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 81: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 82: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 83: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 84: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,927 INFO L290 TraceCheckUtils]: 85: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 86: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 87: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {120945#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 89: Hoare triple {120945#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 90: Hoare triple {120945#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 91: Hoare triple {120945#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 92: Hoare triple {120945#true} assume 4416 == #t~mem54;havoc #t~mem54; {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 93: Hoare triple {120945#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 94: Hoare triple {120945#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 95: Hoare triple {120945#true} 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; {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 96: Hoare triple {120945#true} assume !(0 == ~tmp___6~0); {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 97: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 98: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-08 08:42:08,928 INFO L290 TraceCheckUtils]: 99: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 100: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 101: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 102: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 103: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 104: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 105: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 106: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 107: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 108: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 109: Hoare triple {120945#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 110: Hoare triple {120945#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 111: Hoare triple {120945#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,929 INFO L290 TraceCheckUtils]: 112: Hoare triple {120945#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 113: Hoare triple {120945#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 114: Hoare triple {120945#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 115: Hoare triple {120945#true} assume 4432 == #t~mem56;havoc #t~mem56; {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 116: Hoare triple {120945#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 117: Hoare triple {120945#true} assume !(5 == ~blastFlag~0); {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 118: Hoare triple {120945#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 119: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 120: Hoare triple {120945#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 121: Hoare triple {120945#true} ~skip~0 := 0; {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 122: Hoare triple {120945#true} assume !false; {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 123: Hoare triple {120945#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); {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 124: Hoare triple {120945#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,930 INFO L290 TraceCheckUtils]: 125: Hoare triple {120945#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 126: Hoare triple {120945#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 127: Hoare triple {120945#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 128: Hoare triple {120945#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 129: Hoare triple {120945#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 130: Hoare triple {120945#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 131: Hoare triple {120945#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 132: Hoare triple {120945#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 133: Hoare triple {120945#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 134: Hoare triple {120945#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 135: Hoare triple {120945#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 136: Hoare triple {120945#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 137: Hoare triple {120945#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 138: Hoare triple {120945#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,931 INFO L290 TraceCheckUtils]: 139: Hoare triple {120945#true} assume 4448 == #t~mem58;havoc #t~mem58; {120945#true} is VALID [2022-04-08 08:42:08,932 INFO L290 TraceCheckUtils]: 140: Hoare triple {120945#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {120945#true} is VALID [2022-04-08 08:42:08,932 INFO L290 TraceCheckUtils]: 141: Hoare triple {120945#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {120945#true} is VALID [2022-04-08 08:42:08,932 INFO L290 TraceCheckUtils]: 142: Hoare triple {120945#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {120945#true} is VALID [2022-04-08 08:42:08,933 INFO L290 TraceCheckUtils]: 143: Hoare triple {120945#true} assume !(0 != #t~mem99);havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4480, ~s.base, 52 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,933 INFO L290 TraceCheckUtils]: 144: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,934 INFO L290 TraceCheckUtils]: 145: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,934 INFO L290 TraceCheckUtils]: 146: Hoare triple {120950#(not (= 4416 (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; {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,934 INFO L290 TraceCheckUtils]: 147: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,935 INFO L290 TraceCheckUtils]: 148: Hoare triple {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,935 INFO L290 TraceCheckUtils]: 149: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,936 INFO L290 TraceCheckUtils]: 150: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,936 INFO L290 TraceCheckUtils]: 151: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,936 INFO L290 TraceCheckUtils]: 152: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,937 INFO L290 TraceCheckUtils]: 153: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,937 INFO L290 TraceCheckUtils]: 154: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,937 INFO L290 TraceCheckUtils]: 155: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,938 INFO L290 TraceCheckUtils]: 156: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,938 INFO L290 TraceCheckUtils]: 157: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,939 INFO L290 TraceCheckUtils]: 158: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,939 INFO L290 TraceCheckUtils]: 159: Hoare triple {120950#(not (= 4416 (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); {120950#(not (= 4416 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:42:08,939 INFO L290 TraceCheckUtils]: 160: Hoare triple {120950#(not (= 4416 (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); {120951#(not (= |ssl3_connect_#t~mem54| 4416))} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 161: Hoare triple {120951#(not (= |ssl3_connect_#t~mem54| 4416))} assume 4416 == #t~mem54;havoc #t~mem54; {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 162: Hoare triple {120946#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 163: Hoare triple {120946#false} assume !(3 == ~blastFlag~0); {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 164: Hoare triple {120946#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; {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 165: Hoare triple {120946#false} assume !(0 == ~tmp___6~0); {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 166: Hoare triple {120946#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); {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 167: Hoare triple {120946#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 168: Hoare triple {120946#false} ~skip~0 := 0; {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 169: Hoare triple {120946#false} assume !false; {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 170: Hoare triple {120946#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); {120946#false} is VALID [2022-04-08 08:42:08,940 INFO L290 TraceCheckUtils]: 171: Hoare triple {120946#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 172: Hoare triple {120946#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 173: Hoare triple {120946#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 174: Hoare triple {120946#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 175: Hoare triple {120946#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 176: Hoare triple {120946#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 177: Hoare triple {120946#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 178: Hoare triple {120946#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 179: Hoare triple {120946#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 180: Hoare triple {120946#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 181: Hoare triple {120946#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 182: Hoare triple {120946#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 183: Hoare triple {120946#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 184: Hoare triple {120946#false} assume 4432 == #t~mem56;havoc #t~mem56; {120946#false} is VALID [2022-04-08 08:42:08,941 INFO L290 TraceCheckUtils]: 185: Hoare triple {120946#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {120946#false} is VALID [2022-04-08 08:42:08,942 INFO L290 TraceCheckUtils]: 186: Hoare triple {120946#false} assume 5 == ~blastFlag~0; {120946#false} is VALID [2022-04-08 08:42:08,949 INFO L290 TraceCheckUtils]: 187: Hoare triple {120946#false} assume !false; {120946#false} is VALID [2022-04-08 08:42:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:42:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:08,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554578737] [2022-04-08 08:42:08,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554578737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:08,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:08,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:08,951 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:08,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1450492896] [2022-04-08 08:42:08,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1450492896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:08,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:08,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756012142] [2022-04-08 08:42:08,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 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 188 [2022-04-08 08:42:08,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:08,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:09,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:09,053 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:09,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:09,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:09,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:09,054 INFO L87 Difference]: Start difference. First operand 1049 states and 1532 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:11,082 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-08 08:42:12,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:12,452 INFO L93 Difference]: Finished difference Result 2533 states and 3684 transitions. [2022-04-08 08:42:12,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:12,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 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 188 [2022-04-08 08:42:12,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:12,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-08 08:42:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-08 08:42:12,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-08 08:42:12,793 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-08 08:42:12,877 INFO L225 Difference]: With dead ends: 2533 [2022-04-08 08:42:12,877 INFO L226 Difference]: Without dead ends: 1500 [2022-04-08 08:42:12,878 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:12,878 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:42:12,879 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 286 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 386 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:42:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1500 states. [2022-04-08 08:42:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1500 to 1067. [2022-04-08 08:42:12,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:12,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1500 states. Second operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:12,948 INFO L74 IsIncluded]: Start isIncluded. First operand 1500 states. Second operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:12,949 INFO L87 Difference]: Start difference. First operand 1500 states. Second operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:13,012 INFO L93 Difference]: Finished difference Result 1500 states and 2163 transitions. [2022-04-08 08:42:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2163 transitions. [2022-04-08 08:42:13,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:13,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:13,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 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 1500 states. [2022-04-08 08:42:13,015 INFO L87 Difference]: Start difference. First operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 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 1500 states. [2022-04-08 08:42:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:13,078 INFO L93 Difference]: Finished difference Result 1500 states and 2163 transitions. [2022-04-08 08:42:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 2163 transitions. [2022-04-08 08:42:13,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:13,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:13,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:13,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1062 states have (on average 1.4623352165725048) internal successors, (1553), 1062 states have internal predecessors, (1553), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1557 transitions. [2022-04-08 08:42:13,139 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1557 transitions. Word has length 188 [2022-04-08 08:42:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:13,139 INFO L478 AbstractCegarLoop]: Abstraction has 1067 states and 1557 transitions. [2022-04-08 08:42:13,140 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:13,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1067 states and 1557 transitions. [2022-04-08 08:42:14,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1557 edges. 1557 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1557 transitions. [2022-04-08 08:42:14,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-08 08:42:14,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:14,762 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:14,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-08 08:42:14,762 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:14,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:14,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1954262571, now seen corresponding path program 1 times [2022-04-08 08:42:14,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:14,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1602511760] [2022-04-08 08:42:26,082 WARN L232 SmtUtils]: Spent 10.91s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:42:35,438 WARN L232 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:42:42,531 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:42:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1954262571, now seen corresponding path program 2 times [2022-04-08 08:42:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:42:42,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182114832] [2022-04-08 08:42:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:42:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:42:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:42:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:42:42,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {131164#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {131157#true} is VALID [2022-04-08 08:42:42,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {131157#true} assume true; {131157#true} is VALID [2022-04-08 08:42:42,769 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {131157#true} {131157#true} #592#return; {131157#true} is VALID [2022-04-08 08:42:42,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {131157#true} call ULTIMATE.init(); {131164#(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-08 08:42:42,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {131164#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {131157#true} is VALID [2022-04-08 08:42:42,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {131157#true} assume true; {131157#true} is VALID [2022-04-08 08:42:42,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {131157#true} {131157#true} #592#return; {131157#true} is VALID [2022-04-08 08:42:42,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {131157#true} call #t~ret159 := main(); {131157#true} is VALID [2022-04-08 08:42:42,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {131157#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {131157#true} is VALID [2022-04-08 08:42:42,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {131157#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {131157#true} is VALID [2022-04-08 08:42:42,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {131157#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {131157#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; {131157#true} is VALID [2022-04-08 08:42:42,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {131157#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; {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {131157#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {131157#true} assume 12292 == #t~mem43;havoc #t~mem43; {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {131157#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; {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {131157#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {131157#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {131157#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {131157#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {131157#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {131157#true} is VALID [2022-04-08 08:42:42,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {131157#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {131157#true} assume 4368 == #t~mem48;havoc #t~mem48; {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {131157#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; {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {131157#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {131157#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; {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 42: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 50: Hoare triple {131157#true} assume 4384 == #t~mem50;havoc #t~mem50; {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {131157#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {131157#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {131157#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {131157#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {131157#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-08 08:42:42,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 59: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 60: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 61: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 62: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 63: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 64: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {131157#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {131157#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {131157#true} assume 4400 == #t~mem52;havoc #t~mem52; {131157#true} is VALID [2022-04-08 08:42:42,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 72: Hoare triple {131157#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; {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 73: Hoare triple {131157#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {131157#true} assume !(~ret~0 <= 0); {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {131157#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 84: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 85: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 86: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 87: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 88: Hoare triple {131157#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 89: Hoare triple {131157#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 90: Hoare triple {131157#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 91: Hoare triple {131157#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 92: Hoare triple {131157#true} assume 4416 == #t~mem54;havoc #t~mem54; {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 93: Hoare triple {131157#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 94: Hoare triple {131157#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {131157#true} 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; {131157#true} is VALID [2022-04-08 08:42:42,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {131157#true} assume !(0 == ~tmp___6~0); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 97: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 98: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 99: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 100: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 101: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 102: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 103: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 104: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 105: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 106: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 107: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 108: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,778 INFO L290 TraceCheckUtils]: 109: Hoare triple {131157#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 110: Hoare triple {131157#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 111: Hoare triple {131157#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 112: Hoare triple {131157#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 113: Hoare triple {131157#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 114: Hoare triple {131157#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 115: Hoare triple {131157#true} assume 4432 == #t~mem56;havoc #t~mem56; {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 116: Hoare triple {131157#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 117: Hoare triple {131157#true} assume !(5 == ~blastFlag~0); {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 118: Hoare triple {131157#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 119: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 120: Hoare triple {131157#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 121: Hoare triple {131157#true} ~skip~0 := 0; {131157#true} is VALID [2022-04-08 08:42:42,779 INFO L290 TraceCheckUtils]: 122: Hoare triple {131157#true} assume !false; {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 123: Hoare triple {131157#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); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 124: Hoare triple {131157#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 125: Hoare triple {131157#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 126: Hoare triple {131157#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 127: Hoare triple {131157#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 128: Hoare triple {131157#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 129: Hoare triple {131157#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 130: Hoare triple {131157#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 131: Hoare triple {131157#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 132: Hoare triple {131157#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 133: Hoare triple {131157#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 134: Hoare triple {131157#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,780 INFO L290 TraceCheckUtils]: 135: Hoare triple {131157#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,781 INFO L290 TraceCheckUtils]: 136: Hoare triple {131157#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,781 INFO L290 TraceCheckUtils]: 137: Hoare triple {131157#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,781 INFO L290 TraceCheckUtils]: 138: Hoare triple {131157#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,781 INFO L290 TraceCheckUtils]: 139: Hoare triple {131157#true} assume 4448 == #t~mem58;havoc #t~mem58; {131157#true} is VALID [2022-04-08 08:42:42,781 INFO L290 TraceCheckUtils]: 140: Hoare triple {131157#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {131157#true} is VALID [2022-04-08 08:42:42,781 INFO L290 TraceCheckUtils]: 141: Hoare triple {131157#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {131157#true} is VALID [2022-04-08 08:42:42,781 INFO L290 TraceCheckUtils]: 142: Hoare triple {131157#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {131157#true} is VALID [2022-04-08 08:42:42,782 INFO L290 TraceCheckUtils]: 143: Hoare triple {131157#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,783 INFO L290 TraceCheckUtils]: 144: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,783 INFO L290 TraceCheckUtils]: 145: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,783 INFO L290 TraceCheckUtils]: 146: Hoare triple {131162#(= 4464 (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; {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,784 INFO L290 TraceCheckUtils]: 147: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,784 INFO L290 TraceCheckUtils]: 148: Hoare triple {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,784 INFO L290 TraceCheckUtils]: 149: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,785 INFO L290 TraceCheckUtils]: 150: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,785 INFO L290 TraceCheckUtils]: 151: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,786 INFO L290 TraceCheckUtils]: 152: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,786 INFO L290 TraceCheckUtils]: 153: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,786 INFO L290 TraceCheckUtils]: 154: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,787 INFO L290 TraceCheckUtils]: 155: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,787 INFO L290 TraceCheckUtils]: 156: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,787 INFO L290 TraceCheckUtils]: 157: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,788 INFO L290 TraceCheckUtils]: 158: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,788 INFO L290 TraceCheckUtils]: 159: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,789 INFO L290 TraceCheckUtils]: 160: Hoare triple {131162#(= 4464 (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); {131162#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:42:42,789 INFO L290 TraceCheckUtils]: 161: Hoare triple {131162#(= 4464 (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); {131163#(= |ssl3_connect_#t~mem55| 4464)} is VALID [2022-04-08 08:42:42,789 INFO L290 TraceCheckUtils]: 162: Hoare triple {131163#(= |ssl3_connect_#t~mem55| 4464)} assume 4417 == #t~mem55;havoc #t~mem55; {131158#false} is VALID [2022-04-08 08:42:42,789 INFO L290 TraceCheckUtils]: 163: Hoare triple {131158#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {131158#false} is VALID [2022-04-08 08:42:42,789 INFO L290 TraceCheckUtils]: 164: Hoare triple {131158#false} assume !(3 == ~blastFlag~0); {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 165: Hoare triple {131158#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; {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 166: Hoare triple {131158#false} assume !(0 == ~tmp___6~0); {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 167: Hoare triple {131158#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); {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 168: Hoare triple {131158#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 169: Hoare triple {131158#false} ~skip~0 := 0; {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 170: Hoare triple {131158#false} assume !false; {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 171: Hoare triple {131158#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); {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 172: Hoare triple {131158#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 173: Hoare triple {131158#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 174: Hoare triple {131158#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 175: Hoare triple {131158#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,790 INFO L290 TraceCheckUtils]: 176: Hoare triple {131158#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 177: Hoare triple {131158#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 178: Hoare triple {131158#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 179: Hoare triple {131158#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 180: Hoare triple {131158#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 181: Hoare triple {131158#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 182: Hoare triple {131158#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 183: Hoare triple {131158#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 184: Hoare triple {131158#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 185: Hoare triple {131158#false} assume 4432 == #t~mem56;havoc #t~mem56; {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 186: Hoare triple {131158#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 187: Hoare triple {131158#false} assume 5 == ~blastFlag~0; {131158#false} is VALID [2022-04-08 08:42:42,791 INFO L290 TraceCheckUtils]: 188: Hoare triple {131158#false} assume !false; {131158#false} is VALID [2022-04-08 08:42:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:42:42,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:42:42,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182114832] [2022-04-08 08:42:42,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182114832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:42,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:42,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:42,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:42:42,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1602511760] [2022-04-08 08:42:42,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1602511760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:42:42,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:42:42,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:42:42,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560635760] [2022-04-08 08:42:42,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:42:42,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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 189 [2022-04-08 08:42:42,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:42:42,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:42,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:42,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:42:42,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:42:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:42:42,890 INFO L87 Difference]: Start difference. First operand 1067 states and 1557 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:44,921 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-08 08:42:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:46,620 INFO L93 Difference]: Finished difference Result 2461 states and 3585 transitions. [2022-04-08 08:42:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:42:46,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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 189 [2022-04-08 08:42:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:42:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:46,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 08:42:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 463 transitions. [2022-04-08 08:42:46,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 463 transitions. [2022-04-08 08:42:46,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:47,007 INFO L225 Difference]: With dead ends: 2461 [2022-04-08 08:42:47,007 INFO L226 Difference]: Without dead ends: 1410 [2022-04-08 08:42:47,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:42:47,008 INFO L913 BasicCegarLoop]: 233 mSDtfsCounter, 84 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 558 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-08 08:42:47,009 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 558 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-08 08:42:47,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-04-08 08:42:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1163. [2022-04-08 08:42:47,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:42:47,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1410 states. Second operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,083 INFO L74 IsIncluded]: Start isIncluded. First operand 1410 states. Second operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,084 INFO L87 Difference]: Start difference. First operand 1410 states. Second operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:47,139 INFO L93 Difference]: Finished difference Result 1410 states and 2044 transitions. [2022-04-08 08:42:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2044 transitions. [2022-04-08 08:42:47,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:47,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:47,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 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 1410 states. [2022-04-08 08:42:47,143 INFO L87 Difference]: Start difference. First operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 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 1410 states. [2022-04-08 08:42:47,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:42:47,197 INFO L93 Difference]: Finished difference Result 1410 states and 2044 transitions. [2022-04-08 08:42:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 2044 transitions. [2022-04-08 08:42:47,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:42:47,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:42:47,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:42:47,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:42:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1158 states have (on average 1.4620034542314335) internal successors, (1693), 1158 states have internal predecessors, (1693), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1697 transitions. [2022-04-08 08:42:47,265 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1697 transitions. Word has length 189 [2022-04-08 08:42:47,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:42:47,266 INFO L478 AbstractCegarLoop]: Abstraction has 1163 states and 1697 transitions. [2022-04-08 08:42:47,266 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:42:47,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1163 states and 1697 transitions. [2022-04-08 08:42:48,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1697 edges. 1697 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:42:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1697 transitions. [2022-04-08 08:42:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-08 08:42:48,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:42:48,983 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:42:48,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-08 08:42:48,983 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:42:48,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:42:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash -412432023, now seen corresponding path program 1 times [2022-04-08 08:42:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:42:48,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519180512] [2022-04-08 08:43:07,852 WARN L232 SmtUtils]: Spent 18.49s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:43:19,125 WARN L232 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:43:25,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:25,987 INFO L85 PathProgramCache]: Analyzing trace with hash -412432023, now seen corresponding path program 2 times [2022-04-08 08:43:25,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:25,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644527989] [2022-04-08 08:43:25,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:25,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:26,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:26,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {141244#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141237#true} is VALID [2022-04-08 08:43:26,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {141237#true} assume true; {141237#true} is VALID [2022-04-08 08:43:26,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141237#true} {141237#true} #592#return; {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {141237#true} call ULTIMATE.init(); {141244#(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-08 08:43:26,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {141244#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {141237#true} assume true; {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141237#true} {141237#true} #592#return; {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {141237#true} call #t~ret159 := main(); {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {141237#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {141237#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {141237#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {141237#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; {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {141237#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; {141237#true} is VALID [2022-04-08 08:43:26,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {141237#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {141237#true} assume 12292 == #t~mem43;havoc #t~mem43; {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {141237#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; {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {141237#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {141237#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {141237#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {141237#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {141237#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {141237#true} is VALID [2022-04-08 08:43:26,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {141237#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {141237#true} assume 4368 == #t~mem48;havoc #t~mem48; {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {141237#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; {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {141237#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {141237#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; {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 43: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 49: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 50: Hoare triple {141237#true} assume 4384 == #t~mem50;havoc #t~mem50; {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 51: Hoare triple {141237#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {141237#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {141237#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {141237#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {141237#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 56: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 58: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 63: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 64: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 67: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 68: Hoare triple {141237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 69: Hoare triple {141237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 70: Hoare triple {141237#true} assume 4400 == #t~mem52;havoc #t~mem52; {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 71: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 72: Hoare triple {141237#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; {141237#true} is VALID [2022-04-08 08:43:26,224 INFO L290 TraceCheckUtils]: 73: Hoare triple {141237#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 74: Hoare triple {141237#true} assume !(~ret~0 <= 0); {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 75: Hoare triple {141237#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 77: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 78: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 79: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 80: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 81: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 82: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 83: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 84: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,225 INFO L290 TraceCheckUtils]: 85: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 86: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 87: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 88: Hoare triple {141237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 89: Hoare triple {141237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 90: Hoare triple {141237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 91: Hoare triple {141237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 92: Hoare triple {141237#true} assume 4416 == #t~mem54;havoc #t~mem54; {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 93: Hoare triple {141237#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 94: Hoare triple {141237#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 95: Hoare triple {141237#true} 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; {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 96: Hoare triple {141237#true} assume !(0 == ~tmp___6~0); {141237#true} is VALID [2022-04-08 08:43:26,226 INFO L290 TraceCheckUtils]: 97: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 98: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 99: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 100: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 101: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 102: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 103: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 104: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 105: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 106: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 107: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 108: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,227 INFO L290 TraceCheckUtils]: 109: Hoare triple {141237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 110: Hoare triple {141237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 111: Hoare triple {141237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 112: Hoare triple {141237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 113: Hoare triple {141237#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 114: Hoare triple {141237#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 115: Hoare triple {141237#true} assume 4432 == #t~mem56;havoc #t~mem56; {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 116: Hoare triple {141237#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 117: Hoare triple {141237#true} assume !(5 == ~blastFlag~0); {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 118: Hoare triple {141237#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 119: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,228 INFO L290 TraceCheckUtils]: 120: Hoare triple {141237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 121: Hoare triple {141237#true} ~skip~0 := 0; {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 122: Hoare triple {141237#true} assume !false; {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 123: Hoare triple {141237#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); {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 124: Hoare triple {141237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 125: Hoare triple {141237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 126: Hoare triple {141237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 127: Hoare triple {141237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 128: Hoare triple {141237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 129: Hoare triple {141237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 130: Hoare triple {141237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 131: Hoare triple {141237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,229 INFO L290 TraceCheckUtils]: 132: Hoare triple {141237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 133: Hoare triple {141237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 134: Hoare triple {141237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 135: Hoare triple {141237#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 136: Hoare triple {141237#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 137: Hoare triple {141237#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 138: Hoare triple {141237#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 139: Hoare triple {141237#true} assume 4448 == #t~mem58;havoc #t~mem58; {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 140: Hoare triple {141237#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 141: Hoare triple {141237#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {141237#true} is VALID [2022-04-08 08:43:26,230 INFO L290 TraceCheckUtils]: 142: Hoare triple {141237#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {141237#true} is VALID [2022-04-08 08:43:26,231 INFO L290 TraceCheckUtils]: 143: Hoare triple {141237#true} assume !(0 != #t~mem99);havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4480, ~s.base, 52 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,232 INFO L290 TraceCheckUtils]: 144: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,233 INFO L290 TraceCheckUtils]: 145: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,233 INFO L290 TraceCheckUtils]: 146: Hoare triple {141242#(not (= 4417 (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; {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,233 INFO L290 TraceCheckUtils]: 147: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,234 INFO L290 TraceCheckUtils]: 148: Hoare triple {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,234 INFO L290 TraceCheckUtils]: 149: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,234 INFO L290 TraceCheckUtils]: 150: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,235 INFO L290 TraceCheckUtils]: 151: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,235 INFO L290 TraceCheckUtils]: 152: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,235 INFO L290 TraceCheckUtils]: 153: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,236 INFO L290 TraceCheckUtils]: 154: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,236 INFO L290 TraceCheckUtils]: 155: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,236 INFO L290 TraceCheckUtils]: 156: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,237 INFO L290 TraceCheckUtils]: 157: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,237 INFO L290 TraceCheckUtils]: 158: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,237 INFO L290 TraceCheckUtils]: 159: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,238 INFO L290 TraceCheckUtils]: 160: Hoare triple {141242#(not (= 4417 (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); {141242#(not (= 4417 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:26,238 INFO L290 TraceCheckUtils]: 161: Hoare triple {141242#(not (= 4417 (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); {141243#(not (= |ssl3_connect_#t~mem55| 4417))} is VALID [2022-04-08 08:43:26,238 INFO L290 TraceCheckUtils]: 162: Hoare triple {141243#(not (= |ssl3_connect_#t~mem55| 4417))} assume 4417 == #t~mem55;havoc #t~mem55; {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 163: Hoare triple {141238#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 164: Hoare triple {141238#false} assume !(3 == ~blastFlag~0); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 165: Hoare triple {141238#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; {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 166: Hoare triple {141238#false} assume !(0 == ~tmp___6~0); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 167: Hoare triple {141238#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); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 168: Hoare triple {141238#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 169: Hoare triple {141238#false} ~skip~0 := 0; {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 170: Hoare triple {141238#false} assume !false; {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 171: Hoare triple {141238#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); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 172: Hoare triple {141238#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 173: Hoare triple {141238#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 174: Hoare triple {141238#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 175: Hoare triple {141238#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 176: Hoare triple {141238#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 177: Hoare triple {141238#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 178: Hoare triple {141238#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,239 INFO L290 TraceCheckUtils]: 179: Hoare triple {141238#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L290 TraceCheckUtils]: 180: Hoare triple {141238#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L290 TraceCheckUtils]: 181: Hoare triple {141238#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L290 TraceCheckUtils]: 182: Hoare triple {141238#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L290 TraceCheckUtils]: 183: Hoare triple {141238#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L290 TraceCheckUtils]: 184: Hoare triple {141238#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L290 TraceCheckUtils]: 185: Hoare triple {141238#false} assume 4432 == #t~mem56;havoc #t~mem56; {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L290 TraceCheckUtils]: 186: Hoare triple {141238#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L290 TraceCheckUtils]: 187: Hoare triple {141238#false} assume 5 == ~blastFlag~0; {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L290 TraceCheckUtils]: 188: Hoare triple {141238#false} assume !false; {141238#false} is VALID [2022-04-08 08:43:26,240 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:43:26,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:26,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644527989] [2022-04-08 08:43:26,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644527989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:26,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:26,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:26,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:26,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519180512] [2022-04-08 08:43:26,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519180512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:26,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:26,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:26,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921543851] [2022-04-08 08:43:26,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:26,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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 189 [2022-04-08 08:43:26,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:26,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:26,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:26,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:26,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:26,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:26,322 INFO L87 Difference]: Start difference. First operand 1163 states and 1697 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:28,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-08 08:43:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:29,848 INFO L93 Difference]: Finished difference Result 2636 states and 3824 transitions. [2022-04-08 08:43:29,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 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 189 [2022-04-08 08:43:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-08 08:43:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2022-04-08 08:43:29,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 476 transitions. [2022-04-08 08:43:30,186 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-08 08:43:30,269 INFO L225 Difference]: With dead ends: 2636 [2022-04-08 08:43:30,270 INFO L226 Difference]: Without dead ends: 1489 [2022-04-08 08:43:30,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:30,272 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 106 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:30,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 296 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:43:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2022-04-08 08:43:30,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1067. [2022-04-08 08:43:30,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:30,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1489 states. Second operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:30,353 INFO L74 IsIncluded]: Start isIncluded. First operand 1489 states. Second operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:30,354 INFO L87 Difference]: Start difference. First operand 1489 states. Second operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:30,417 INFO L93 Difference]: Finished difference Result 1489 states and 2138 transitions. [2022-04-08 08:43:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2138 transitions. [2022-04-08 08:43:30,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:30,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:30,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 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 1489 states. [2022-04-08 08:43:30,421 INFO L87 Difference]: Start difference. First operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 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 1489 states. [2022-04-08 08:43:30,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:30,483 INFO L93 Difference]: Finished difference Result 1489 states and 2138 transitions. [2022-04-08 08:43:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 2138 transitions. [2022-04-08 08:43:30,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:30,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:30,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:30,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:30,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 1062 states have (on average 1.4538606403013183) internal successors, (1544), 1062 states have internal predecessors, (1544), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1548 transitions. [2022-04-08 08:43:30,543 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1548 transitions. Word has length 189 [2022-04-08 08:43:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:30,543 INFO L478 AbstractCegarLoop]: Abstraction has 1067 states and 1548 transitions. [2022-04-08 08:43:30,543 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:30,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1067 states and 1548 transitions. [2022-04-08 08:43:32,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1548 edges. 1548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1548 transitions. [2022-04-08 08:43:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-08 08:43:32,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:32,185 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:32,186 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-08 08:43:32,186 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1003216029, now seen corresponding path program 1 times [2022-04-08 08:43:32,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:32,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1061184613] [2022-04-08 08:43:32,187 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1003216029, now seen corresponding path program 2 times [2022-04-08 08:43:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:32,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906354737] [2022-04-08 08:43:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:32,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:32,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {151640#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {151633#true} is VALID [2022-04-08 08:43:32,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {151633#true} assume true; {151633#true} is VALID [2022-04-08 08:43:32,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {151633#true} {151633#true} #592#return; {151633#true} is VALID [2022-04-08 08:43:32,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {151633#true} call ULTIMATE.init(); {151640#(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-08 08:43:32,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {151640#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {151633#true} is VALID [2022-04-08 08:43:32,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {151633#true} assume true; {151633#true} is VALID [2022-04-08 08:43:32,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151633#true} {151633#true} #592#return; {151633#true} is VALID [2022-04-08 08:43:32,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {151633#true} call #t~ret159 := main(); {151633#true} is VALID [2022-04-08 08:43:32,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {151633#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {151633#true} is VALID [2022-04-08 08:43:32,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {151633#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {151633#true} is VALID [2022-04-08 08:43:32,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {151633#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {151633#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; {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {151633#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; {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {151633#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {151633#true} assume 12292 == #t~mem43;havoc #t~mem43; {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {151633#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; {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {151633#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {151633#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {151633#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {151633#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {151633#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {151633#true} is VALID [2022-04-08 08:43:32,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {151633#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 30: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,415 INFO L290 TraceCheckUtils]: 33: Hoare triple {151633#true} assume 4368 == #t~mem48;havoc #t~mem48; {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {151633#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; {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {151633#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {151633#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; {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 44: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 45: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,416 INFO L290 TraceCheckUtils]: 46: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 47: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {151633#true} assume 4384 == #t~mem50;havoc #t~mem50; {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 51: Hoare triple {151633#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {151633#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 53: Hoare triple {151633#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 54: Hoare triple {151633#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 55: Hoare triple {151633#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 56: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 57: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-08 08:43:32,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 60: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 61: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 62: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 63: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 64: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 65: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 66: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {151633#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 69: Hoare triple {151633#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 70: Hoare triple {151633#true} assume 4400 == #t~mem52;havoc #t~mem52; {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 71: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,418 INFO L290 TraceCheckUtils]: 72: Hoare triple {151633#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; {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 73: Hoare triple {151633#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 74: Hoare triple {151633#true} assume !(~ret~0 <= 0); {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 75: Hoare triple {151633#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 76: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 77: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 78: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 79: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 80: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 81: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 82: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 83: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,419 INFO L290 TraceCheckUtils]: 84: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 85: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 86: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 87: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 88: Hoare triple {151633#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 89: Hoare triple {151633#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 90: Hoare triple {151633#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 91: Hoare triple {151633#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 92: Hoare triple {151633#true} assume 4416 == #t~mem54;havoc #t~mem54; {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 93: Hoare triple {151633#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 94: Hoare triple {151633#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 95: Hoare triple {151633#true} 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; {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 96: Hoare triple {151633#true} assume !(0 == ~tmp___6~0); {151633#true} is VALID [2022-04-08 08:43:32,420 INFO L290 TraceCheckUtils]: 97: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 98: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 99: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 100: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 101: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 102: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 103: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 104: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 105: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 106: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 107: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 108: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 109: Hoare triple {151633#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,421 INFO L290 TraceCheckUtils]: 110: Hoare triple {151633#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 111: Hoare triple {151633#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 112: Hoare triple {151633#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 113: Hoare triple {151633#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 114: Hoare triple {151633#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 115: Hoare triple {151633#true} assume 4432 == #t~mem56;havoc #t~mem56; {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 116: Hoare triple {151633#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 117: Hoare triple {151633#true} assume !(5 == ~blastFlag~0); {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 118: Hoare triple {151633#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 119: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 120: Hoare triple {151633#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 121: Hoare triple {151633#true} ~skip~0 := 0; {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 122: Hoare triple {151633#true} assume !false; {151633#true} is VALID [2022-04-08 08:43:32,422 INFO L290 TraceCheckUtils]: 123: Hoare triple {151633#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); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 124: Hoare triple {151633#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 125: Hoare triple {151633#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 126: Hoare triple {151633#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 127: Hoare triple {151633#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 128: Hoare triple {151633#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 129: Hoare triple {151633#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 130: Hoare triple {151633#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 131: Hoare triple {151633#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 132: Hoare triple {151633#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 133: Hoare triple {151633#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 134: Hoare triple {151633#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 135: Hoare triple {151633#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,423 INFO L290 TraceCheckUtils]: 136: Hoare triple {151633#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,424 INFO L290 TraceCheckUtils]: 137: Hoare triple {151633#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,424 INFO L290 TraceCheckUtils]: 138: Hoare triple {151633#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,424 INFO L290 TraceCheckUtils]: 139: Hoare triple {151633#true} assume 4448 == #t~mem58;havoc #t~mem58; {151633#true} is VALID [2022-04-08 08:43:32,424 INFO L290 TraceCheckUtils]: 140: Hoare triple {151633#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {151633#true} is VALID [2022-04-08 08:43:32,424 INFO L290 TraceCheckUtils]: 141: Hoare triple {151633#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {151633#true} is VALID [2022-04-08 08:43:32,424 INFO L290 TraceCheckUtils]: 142: Hoare triple {151633#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {151633#true} is VALID [2022-04-08 08:43:32,425 INFO L290 TraceCheckUtils]: 143: Hoare triple {151633#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,426 INFO L290 TraceCheckUtils]: 144: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,426 INFO L290 TraceCheckUtils]: 145: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,426 INFO L290 TraceCheckUtils]: 146: Hoare triple {151638#(not (= 4512 (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; {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,427 INFO L290 TraceCheckUtils]: 147: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,427 INFO L290 TraceCheckUtils]: 148: Hoare triple {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,427 INFO L290 TraceCheckUtils]: 149: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,427 INFO L290 TraceCheckUtils]: 150: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,428 INFO L290 TraceCheckUtils]: 151: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,428 INFO L290 TraceCheckUtils]: 152: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,428 INFO L290 TraceCheckUtils]: 153: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,460 INFO L290 TraceCheckUtils]: 154: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,460 INFO L290 TraceCheckUtils]: 155: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,460 INFO L290 TraceCheckUtils]: 156: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,461 INFO L290 TraceCheckUtils]: 157: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,461 INFO L290 TraceCheckUtils]: 158: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,461 INFO L290 TraceCheckUtils]: 159: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,462 INFO L290 TraceCheckUtils]: 160: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,462 INFO L290 TraceCheckUtils]: 161: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,462 INFO L290 TraceCheckUtils]: 162: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,463 INFO L290 TraceCheckUtils]: 163: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,463 INFO L290 TraceCheckUtils]: 164: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,463 INFO L290 TraceCheckUtils]: 165: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,464 INFO L290 TraceCheckUtils]: 166: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,464 INFO L290 TraceCheckUtils]: 167: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,464 INFO L290 TraceCheckUtils]: 168: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,465 INFO L290 TraceCheckUtils]: 169: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,465 INFO L290 TraceCheckUtils]: 170: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,465 INFO L290 TraceCheckUtils]: 171: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,465 INFO L290 TraceCheckUtils]: 172: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,466 INFO L290 TraceCheckUtils]: 173: Hoare triple {151638#(not (= 4512 (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); {151638#(not (= 4512 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:32,466 INFO L290 TraceCheckUtils]: 174: Hoare triple {151638#(not (= 4512 (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); {151639#(not (= |ssl3_connect_#t~mem68| 4512))} is VALID [2022-04-08 08:43:32,467 INFO L290 TraceCheckUtils]: 175: Hoare triple {151639#(not (= |ssl3_connect_#t~mem68| 4512))} assume 4512 == #t~mem68;havoc #t~mem68; {151634#false} is VALID [2022-04-08 08:43:32,474 INFO L290 TraceCheckUtils]: 176: Hoare triple {151634#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {151634#false} is VALID [2022-04-08 08:43:32,474 INFO L290 TraceCheckUtils]: 177: Hoare triple {151634#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); {151634#false} is VALID [2022-04-08 08:43:32,474 INFO L290 TraceCheckUtils]: 178: Hoare triple {151634#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; {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 179: Hoare triple {151634#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 180: Hoare triple {151634#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 181: Hoare triple {151634#false} assume !(0 == ~tmp___8~0); {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 182: Hoare triple {151634#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); {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 183: Hoare triple {151634#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 184: Hoare triple {151634#false} ~skip~0 := 0; {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 185: Hoare triple {151634#false} assume !false; {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 186: Hoare triple {151634#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); {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 187: Hoare triple {151634#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 188: Hoare triple {151634#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,475 INFO L290 TraceCheckUtils]: 189: Hoare triple {151634#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 190: Hoare triple {151634#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 191: Hoare triple {151634#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 192: Hoare triple {151634#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 193: Hoare triple {151634#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 194: Hoare triple {151634#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 195: Hoare triple {151634#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 196: Hoare triple {151634#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 197: Hoare triple {151634#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 198: Hoare triple {151634#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 199: Hoare triple {151634#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 200: Hoare triple {151634#false} assume 4432 == #t~mem56;havoc #t~mem56; {151634#false} is VALID [2022-04-08 08:43:32,476 INFO L290 TraceCheckUtils]: 201: Hoare triple {151634#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {151634#false} is VALID [2022-04-08 08:43:32,477 INFO L290 TraceCheckUtils]: 202: Hoare triple {151634#false} assume 5 == ~blastFlag~0; {151634#false} is VALID [2022-04-08 08:43:32,477 INFO L290 TraceCheckUtils]: 203: Hoare triple {151634#false} assume !false; {151634#false} is VALID [2022-04-08 08:43:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:43:32,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:32,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906354737] [2022-04-08 08:43:32,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906354737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:32,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:32,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:32,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:32,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1061184613] [2022-04-08 08:43:32,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1061184613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:32,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:32,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:32,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879908850] [2022-04-08 08:43:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:32,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 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 204 [2022-04-08 08:43:32,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:32,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:32,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:32,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:32,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:32,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:32,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:32,573 INFO L87 Difference]: Start difference. First operand 1067 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:34,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:36,129 INFO L93 Difference]: Finished difference Result 2579 states and 3716 transitions. [2022-04-08 08:43:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:36,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 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 204 [2022-04-08 08:43:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-08 08:43:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 477 transitions. [2022-04-08 08:43:36,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 477 transitions. [2022-04-08 08:43:36,453 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-08 08:43:36,544 INFO L225 Difference]: With dead ends: 2579 [2022-04-08 08:43:36,544 INFO L226 Difference]: Without dead ends: 1528 [2022-04-08 08:43:36,545 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:36,546 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 92 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:36,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 298 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 396 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:43:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2022-04-08 08:43:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1257. [2022-04-08 08:43:36,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:36,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1528 states. Second operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:36,643 INFO L74 IsIncluded]: Start isIncluded. First operand 1528 states. Second operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:36,644 INFO L87 Difference]: Start difference. First operand 1528 states. Second operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:36,708 INFO L93 Difference]: Finished difference Result 1528 states and 2183 transitions. [2022-04-08 08:43:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2183 transitions. [2022-04-08 08:43:36,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:36,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:36,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 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 1528 states. [2022-04-08 08:43:36,712 INFO L87 Difference]: Start difference. First operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 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 1528 states. [2022-04-08 08:43:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:36,777 INFO L93 Difference]: Finished difference Result 1528 states and 2183 transitions. [2022-04-08 08:43:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2183 transitions. [2022-04-08 08:43:36,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:36,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:36,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:36,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1252 states have (on average 1.468849840255591) internal successors, (1839), 1252 states have internal predecessors, (1839), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:36,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1843 transitions. [2022-04-08 08:43:36,852 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1843 transitions. Word has length 204 [2022-04-08 08:43:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:36,852 INFO L478 AbstractCegarLoop]: Abstraction has 1257 states and 1843 transitions. [2022-04-08 08:43:36,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:36,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1257 states and 1843 transitions. [2022-04-08 08:43:38,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1843 edges. 1843 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1843 transitions. [2022-04-08 08:43:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-08 08:43:38,893 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:38,893 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:38,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-08 08:43:38,894 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:38,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1119072511, now seen corresponding path program 1 times [2022-04-08 08:43:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:38,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [796407837] [2022-04-08 08:43:38,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1119072511, now seen corresponding path program 2 times [2022-04-08 08:43:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:38,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329575579] [2022-04-08 08:43:38,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:38,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:39,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:39,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {162380#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {162373#true} is VALID [2022-04-08 08:43:39,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {162373#true} assume true; {162373#true} is VALID [2022-04-08 08:43:39,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162373#true} {162373#true} #592#return; {162373#true} is VALID [2022-04-08 08:43:39,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {162373#true} call ULTIMATE.init(); {162380#(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-08 08:43:39,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {162380#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {162373#true} is VALID [2022-04-08 08:43:39,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {162373#true} assume true; {162373#true} is VALID [2022-04-08 08:43:39,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162373#true} {162373#true} #592#return; {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {162373#true} call #t~ret159 := main(); {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {162373#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {162373#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {162373#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {162373#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; {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {162373#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; {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {162373#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {162373#true} assume 12292 == #t~mem43;havoc #t~mem43; {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {162373#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; {162373#true} is VALID [2022-04-08 08:43:39,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {162373#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {162373#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {162373#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {162373#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {162373#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {162373#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-08 08:43:39,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 31: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {162373#true} assume 4368 == #t~mem48;havoc #t~mem48; {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 34: Hoare triple {162373#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; {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {162373#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {162373#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; {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 42: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 47: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 49: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 50: Hoare triple {162373#true} assume 4384 == #t~mem50;havoc #t~mem50; {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {162373#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {162373#true} is VALID [2022-04-08 08:43:39,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {162373#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 53: Hoare triple {162373#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {162373#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {162373#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 58: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 62: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 63: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,130 INFO L290 TraceCheckUtils]: 64: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 65: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 66: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 68: Hoare triple {162373#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 69: Hoare triple {162373#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 70: Hoare triple {162373#true} assume 4400 == #t~mem52;havoc #t~mem52; {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 71: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 72: Hoare triple {162373#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; {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 73: Hoare triple {162373#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 74: Hoare triple {162373#true} assume !(~ret~0 <= 0); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 75: Hoare triple {162373#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 76: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,131 INFO L290 TraceCheckUtils]: 77: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 78: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 79: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 80: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 81: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 82: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 83: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 84: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 85: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 86: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 87: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 88: Hoare triple {162373#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,132 INFO L290 TraceCheckUtils]: 89: Hoare triple {162373#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 90: Hoare triple {162373#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 91: Hoare triple {162373#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 92: Hoare triple {162373#true} assume 4416 == #t~mem54;havoc #t~mem54; {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 93: Hoare triple {162373#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 94: Hoare triple {162373#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 95: Hoare triple {162373#true} 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; {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 96: Hoare triple {162373#true} assume !(0 == ~tmp___6~0); {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 97: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 98: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 99: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 100: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 101: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,133 INFO L290 TraceCheckUtils]: 102: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 103: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 104: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 105: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 106: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 107: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 108: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 109: Hoare triple {162373#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 110: Hoare triple {162373#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 111: Hoare triple {162373#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 112: Hoare triple {162373#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 113: Hoare triple {162373#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,134 INFO L290 TraceCheckUtils]: 114: Hoare triple {162373#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 115: Hoare triple {162373#true} assume 4432 == #t~mem56;havoc #t~mem56; {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 116: Hoare triple {162373#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 117: Hoare triple {162373#true} assume !(5 == ~blastFlag~0); {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 118: Hoare triple {162373#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 119: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 120: Hoare triple {162373#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 121: Hoare triple {162373#true} ~skip~0 := 0; {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 122: Hoare triple {162373#true} assume !false; {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 123: Hoare triple {162373#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); {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 124: Hoare triple {162373#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 125: Hoare triple {162373#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 126: Hoare triple {162373#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,135 INFO L290 TraceCheckUtils]: 127: Hoare triple {162373#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 128: Hoare triple {162373#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 129: Hoare triple {162373#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 130: Hoare triple {162373#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 131: Hoare triple {162373#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 132: Hoare triple {162373#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 133: Hoare triple {162373#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 134: Hoare triple {162373#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 135: Hoare triple {162373#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 136: Hoare triple {162373#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 137: Hoare triple {162373#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 138: Hoare triple {162373#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 139: Hoare triple {162373#true} assume 4448 == #t~mem58;havoc #t~mem58; {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 140: Hoare triple {162373#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 141: Hoare triple {162373#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {162373#true} is VALID [2022-04-08 08:43:39,136 INFO L290 TraceCheckUtils]: 142: Hoare triple {162373#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {162373#true} is VALID [2022-04-08 08:43:39,137 INFO L290 TraceCheckUtils]: 143: Hoare triple {162373#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,138 INFO L290 TraceCheckUtils]: 144: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,138 INFO L290 TraceCheckUtils]: 145: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,138 INFO L290 TraceCheckUtils]: 146: Hoare triple {162378#(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; {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,139 INFO L290 TraceCheckUtils]: 147: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,139 INFO L290 TraceCheckUtils]: 148: Hoare triple {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,139 INFO L290 TraceCheckUtils]: 149: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,140 INFO L290 TraceCheckUtils]: 150: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,140 INFO L290 TraceCheckUtils]: 151: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,140 INFO L290 TraceCheckUtils]: 152: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,141 INFO L290 TraceCheckUtils]: 153: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,141 INFO L290 TraceCheckUtils]: 154: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,141 INFO L290 TraceCheckUtils]: 155: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,142 INFO L290 TraceCheckUtils]: 156: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,142 INFO L290 TraceCheckUtils]: 157: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,142 INFO L290 TraceCheckUtils]: 158: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,143 INFO L290 TraceCheckUtils]: 159: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,143 INFO L290 TraceCheckUtils]: 160: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,143 INFO L290 TraceCheckUtils]: 161: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,144 INFO L290 TraceCheckUtils]: 162: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,144 INFO L290 TraceCheckUtils]: 163: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,144 INFO L290 TraceCheckUtils]: 164: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,145 INFO L290 TraceCheckUtils]: 165: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,145 INFO L290 TraceCheckUtils]: 166: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,145 INFO L290 TraceCheckUtils]: 167: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,146 INFO L290 TraceCheckUtils]: 168: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,146 INFO L290 TraceCheckUtils]: 169: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,146 INFO L290 TraceCheckUtils]: 170: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,147 INFO L290 TraceCheckUtils]: 171: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,147 INFO L290 TraceCheckUtils]: 172: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,147 INFO L290 TraceCheckUtils]: 173: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,148 INFO L290 TraceCheckUtils]: 174: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,148 INFO L290 TraceCheckUtils]: 175: Hoare triple {162378#(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); {162378#(not (= 4528 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:39,149 INFO L290 TraceCheckUtils]: 176: Hoare triple {162378#(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); {162379#(not (= |ssl3_connect_#t~mem70| 4528))} is VALID [2022-04-08 08:43:39,149 INFO L290 TraceCheckUtils]: 177: Hoare triple {162379#(not (= |ssl3_connect_#t~mem70| 4528))} assume 4528 == #t~mem70;havoc #t~mem70; {162374#false} is VALID [2022-04-08 08:43:39,149 INFO L290 TraceCheckUtils]: 178: Hoare triple {162374#false} assume -2147483648 <= #t~nondet123 && #t~nondet123 <= 2147483647;~ret~0 := #t~nondet123;havoc #t~nondet123; {162374#false} is VALID [2022-04-08 08:43:39,149 INFO L290 TraceCheckUtils]: 179: Hoare triple {162374#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); {162374#false} is VALID [2022-04-08 08:43:39,149 INFO L290 TraceCheckUtils]: 180: Hoare triple {162374#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; {162374#false} is VALID [2022-04-08 08:43:39,149 INFO L290 TraceCheckUtils]: 181: Hoare triple {162374#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,149 INFO L290 TraceCheckUtils]: 182: Hoare triple {162374#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); {162374#false} is VALID [2022-04-08 08:43:39,149 INFO L290 TraceCheckUtils]: 183: Hoare triple {162374#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {162374#false} is VALID [2022-04-08 08:43:39,149 INFO L290 TraceCheckUtils]: 184: Hoare triple {162374#false} ~skip~0 := 0; {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 185: Hoare triple {162374#false} assume !false; {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 186: Hoare triple {162374#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); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 187: Hoare triple {162374#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 188: Hoare triple {162374#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 189: Hoare triple {162374#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 190: Hoare triple {162374#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 191: Hoare triple {162374#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 192: Hoare triple {162374#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 193: Hoare triple {162374#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 194: Hoare triple {162374#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 195: Hoare triple {162374#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 196: Hoare triple {162374#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 197: Hoare triple {162374#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 198: Hoare triple {162374#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,150 INFO L290 TraceCheckUtils]: 199: Hoare triple {162374#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {162374#false} is VALID [2022-04-08 08:43:39,151 INFO L290 TraceCheckUtils]: 200: Hoare triple {162374#false} assume 4432 == #t~mem56;havoc #t~mem56; {162374#false} is VALID [2022-04-08 08:43:39,151 INFO L290 TraceCheckUtils]: 201: Hoare triple {162374#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {162374#false} is VALID [2022-04-08 08:43:39,151 INFO L290 TraceCheckUtils]: 202: Hoare triple {162374#false} assume 5 == ~blastFlag~0; {162374#false} is VALID [2022-04-08 08:43:39,151 INFO L290 TraceCheckUtils]: 203: Hoare triple {162374#false} assume !false; {162374#false} is VALID [2022-04-08 08:43:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:43:39,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:39,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329575579] [2022-04-08 08:43:39,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329575579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:39,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:39,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:39,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:39,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [796407837] [2022-04-08 08:43:39,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [796407837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:39,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:39,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841923409] [2022-04-08 08:43:39,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:39,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 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 204 [2022-04-08 08:43:39,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:39,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:39,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:39,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:39,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:39,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:39,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:39,244 INFO L87 Difference]: Start difference. First operand 1257 states and 1843 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:41,266 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-08 08:43:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:42,837 INFO L93 Difference]: Finished difference Result 2824 states and 4116 transitions. [2022-04-08 08:43:42,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:42,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 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 204 [2022-04-08 08:43:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:43:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 08:43:42,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 08:43:43,162 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-08 08:43:43,273 INFO L225 Difference]: With dead ends: 2824 [2022-04-08 08:43:43,273 INFO L226 Difference]: Without dead ends: 1583 [2022-04-08 08:43:43,276 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:43,276 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:43,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 296 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:43:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-04-08 08:43:43,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1322. [2022-04-08 08:43:43,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:43,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,393 INFO L74 IsIncluded]: Start isIncluded. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,393 INFO L87 Difference]: Start difference. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:43,474 INFO L93 Difference]: Finished difference Result 1583 states and 2288 transitions. [2022-04-08 08:43:43,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2288 transitions. [2022-04-08 08:43:43,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:43,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:43,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 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 1583 states. [2022-04-08 08:43:43,478 INFO L87 Difference]: Start difference. First operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 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 1583 states. [2022-04-08 08:43:43,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:43,566 INFO L93 Difference]: Finished difference Result 1583 states and 2288 transitions. [2022-04-08 08:43:43,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2288 transitions. [2022-04-08 08:43:43,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:43,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:43,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:43,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1317 states have (on average 1.4912680334092634) internal successors, (1964), 1317 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1968 transitions. [2022-04-08 08:43:43,643 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1968 transitions. Word has length 204 [2022-04-08 08:43:43,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:43,644 INFO L478 AbstractCegarLoop]: Abstraction has 1322 states and 1968 transitions. [2022-04-08 08:43:43,644 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:43,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1322 states and 1968 transitions. [2022-04-08 08:43:45,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1968 edges. 1968 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:45,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1968 transitions. [2022-04-08 08:43:45,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-08 08:43:45,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:46,000 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:46,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-08 08:43:46,000 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:46,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1665641358, now seen corresponding path program 1 times [2022-04-08 08:43:46,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:46,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531708596] [2022-04-08 08:43:46,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:46,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1665641358, now seen corresponding path program 2 times [2022-04-08 08:43:46,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:46,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18071653] [2022-04-08 08:43:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:46,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:46,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {173850#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {173843#true} is VALID [2022-04-08 08:43:46,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {173843#true} assume true; {173843#true} is VALID [2022-04-08 08:43:46,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173843#true} {173843#true} #592#return; {173843#true} is VALID [2022-04-08 08:43:46,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {173843#true} call ULTIMATE.init(); {173850#(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-08 08:43:46,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {173850#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {173843#true} is VALID [2022-04-08 08:43:46,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {173843#true} assume true; {173843#true} is VALID [2022-04-08 08:43:46,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173843#true} {173843#true} #592#return; {173843#true} is VALID [2022-04-08 08:43:46,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {173843#true} call #t~ret159 := main(); {173843#true} is VALID [2022-04-08 08:43:46,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {173843#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {173843#true} is VALID [2022-04-08 08:43:46,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {173843#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {173843#true} is VALID [2022-04-08 08:43:46,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {173843#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {173843#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; {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {173843#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; {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {173843#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {173843#true} assume 12292 == #t~mem43;havoc #t~mem43; {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {173843#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; {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {173843#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {173843#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {173843#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {173843#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {173843#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {173843#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 23: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {173843#true} assume 4368 == #t~mem48;havoc #t~mem48; {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {173843#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; {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {173843#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {173843#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; {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 41: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-08 08:43:46,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 44: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 46: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {173843#true} assume 4384 == #t~mem50;havoc #t~mem50; {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 51: Hoare triple {173843#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {173843#true} is VALID [2022-04-08 08:43:46,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {173843#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 53: Hoare triple {173843#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 54: Hoare triple {173843#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 55: Hoare triple {173843#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 56: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 57: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 58: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 59: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 60: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 61: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 62: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 63: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 64: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,244 INFO L290 TraceCheckUtils]: 65: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 66: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 67: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {173843#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {173843#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 70: Hoare triple {173843#true} assume 4400 == #t~mem52;havoc #t~mem52; {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 71: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 72: Hoare triple {173843#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; {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 73: Hoare triple {173843#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 74: Hoare triple {173843#true} assume !(~ret~0 <= 0); {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 75: Hoare triple {173843#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 76: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 78: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 79: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 80: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 81: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 82: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 83: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 84: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 85: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 86: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 87: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 88: Hoare triple {173843#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 89: Hoare triple {173843#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,246 INFO L290 TraceCheckUtils]: 90: Hoare triple {173843#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 91: Hoare triple {173843#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 92: Hoare triple {173843#true} assume 4416 == #t~mem54;havoc #t~mem54; {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 93: Hoare triple {173843#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 94: Hoare triple {173843#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 95: Hoare triple {173843#true} 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; {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 96: Hoare triple {173843#true} assume !(0 == ~tmp___6~0); {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 97: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 98: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 99: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 100: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-08 08:43:46,247 INFO L290 TraceCheckUtils]: 101: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 102: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 103: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 104: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 105: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 106: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 107: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 108: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 109: Hoare triple {173843#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 110: Hoare triple {173843#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 111: Hoare triple {173843#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 112: Hoare triple {173843#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,248 INFO L290 TraceCheckUtils]: 113: Hoare triple {173843#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 114: Hoare triple {173843#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 115: Hoare triple {173843#true} assume 4432 == #t~mem56;havoc #t~mem56; {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 116: Hoare triple {173843#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 117: Hoare triple {173843#true} assume !(5 == ~blastFlag~0); {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 118: Hoare triple {173843#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 119: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 120: Hoare triple {173843#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 121: Hoare triple {173843#true} ~skip~0 := 0; {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 122: Hoare triple {173843#true} assume !false; {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 123: Hoare triple {173843#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); {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 124: Hoare triple {173843#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,249 INFO L290 TraceCheckUtils]: 125: Hoare triple {173843#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 126: Hoare triple {173843#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 127: Hoare triple {173843#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 128: Hoare triple {173843#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 129: Hoare triple {173843#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 130: Hoare triple {173843#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 131: Hoare triple {173843#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 132: Hoare triple {173843#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 133: Hoare triple {173843#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 134: Hoare triple {173843#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 135: Hoare triple {173843#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 136: Hoare triple {173843#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,250 INFO L290 TraceCheckUtils]: 137: Hoare triple {173843#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,251 INFO L290 TraceCheckUtils]: 138: Hoare triple {173843#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,251 INFO L290 TraceCheckUtils]: 139: Hoare triple {173843#true} assume 4448 == #t~mem58;havoc #t~mem58; {173843#true} is VALID [2022-04-08 08:43:46,251 INFO L290 TraceCheckUtils]: 140: Hoare triple {173843#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {173843#true} is VALID [2022-04-08 08:43:46,251 INFO L290 TraceCheckUtils]: 141: Hoare triple {173843#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {173843#true} is VALID [2022-04-08 08:43:46,251 INFO L290 TraceCheckUtils]: 142: Hoare triple {173843#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {173843#true} is VALID [2022-04-08 08:43:46,252 INFO L290 TraceCheckUtils]: 143: Hoare triple {173843#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,253 INFO L290 TraceCheckUtils]: 144: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,253 INFO L290 TraceCheckUtils]: 145: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,253 INFO L290 TraceCheckUtils]: 146: Hoare triple {173848#(not (= 4513 (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; {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,254 INFO L290 TraceCheckUtils]: 147: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,254 INFO L290 TraceCheckUtils]: 148: Hoare triple {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,254 INFO L290 TraceCheckUtils]: 149: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,255 INFO L290 TraceCheckUtils]: 150: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,255 INFO L290 TraceCheckUtils]: 151: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,255 INFO L290 TraceCheckUtils]: 152: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,255 INFO L290 TraceCheckUtils]: 153: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,256 INFO L290 TraceCheckUtils]: 154: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,256 INFO L290 TraceCheckUtils]: 155: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,256 INFO L290 TraceCheckUtils]: 156: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,257 INFO L290 TraceCheckUtils]: 157: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,257 INFO L290 TraceCheckUtils]: 158: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,257 INFO L290 TraceCheckUtils]: 159: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,258 INFO L290 TraceCheckUtils]: 160: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,258 INFO L290 TraceCheckUtils]: 161: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,258 INFO L290 TraceCheckUtils]: 162: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,258 INFO L290 TraceCheckUtils]: 163: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,259 INFO L290 TraceCheckUtils]: 164: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,259 INFO L290 TraceCheckUtils]: 165: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,259 INFO L290 TraceCheckUtils]: 166: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,260 INFO L290 TraceCheckUtils]: 167: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,260 INFO L290 TraceCheckUtils]: 168: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,260 INFO L290 TraceCheckUtils]: 169: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,261 INFO L290 TraceCheckUtils]: 170: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,261 INFO L290 TraceCheckUtils]: 171: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,261 INFO L290 TraceCheckUtils]: 172: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,261 INFO L290 TraceCheckUtils]: 173: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,262 INFO L290 TraceCheckUtils]: 174: Hoare triple {173848#(not (= 4513 (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); {173848#(not (= 4513 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:46,262 INFO L290 TraceCheckUtils]: 175: Hoare triple {173848#(not (= 4513 (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); {173849#(not (= 4513 |ssl3_connect_#t~mem69|))} is VALID [2022-04-08 08:43:46,262 INFO L290 TraceCheckUtils]: 176: Hoare triple {173849#(not (= 4513 |ssl3_connect_#t~mem69|))} assume 4513 == #t~mem69;havoc #t~mem69; {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 177: Hoare triple {173844#false} assume -2147483648 <= #t~nondet110 && #t~nondet110 <= 2147483647;~ret~0 := #t~nondet110;havoc #t~nondet110; {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 178: Hoare triple {173844#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); {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 179: Hoare triple {173844#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; {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 180: Hoare triple {173844#false} assume -2147483648 <= #t~nondet121 && #t~nondet121 <= 2147483647;~tmp___7~0 := #t~nondet121;havoc #t~nondet121; {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 181: Hoare triple {173844#false} assume !(0 == ~tmp___7~0);assume -2147483648 <= #t~nondet122 && #t~nondet122 <= 2147483647;~tmp___8~0 := #t~nondet122;havoc #t~nondet122; {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 182: Hoare triple {173844#false} assume !(0 == ~tmp___8~0); {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 183: Hoare triple {173844#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); {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 184: Hoare triple {173844#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 185: Hoare triple {173844#false} ~skip~0 := 0; {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 186: Hoare triple {173844#false} assume !false; {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 187: Hoare triple {173844#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); {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 188: Hoare triple {173844#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,263 INFO L290 TraceCheckUtils]: 189: Hoare triple {173844#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 190: Hoare triple {173844#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 191: Hoare triple {173844#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 192: Hoare triple {173844#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 193: Hoare triple {173844#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 194: Hoare triple {173844#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 195: Hoare triple {173844#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 196: Hoare triple {173844#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 197: Hoare triple {173844#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 198: Hoare triple {173844#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 199: Hoare triple {173844#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 200: Hoare triple {173844#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 201: Hoare triple {173844#false} assume 4432 == #t~mem56;havoc #t~mem56; {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 202: Hoare triple {173844#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {173844#false} is VALID [2022-04-08 08:43:46,264 INFO L290 TraceCheckUtils]: 203: Hoare triple {173844#false} assume 5 == ~blastFlag~0; {173844#false} is VALID [2022-04-08 08:43:46,265 INFO L290 TraceCheckUtils]: 204: Hoare triple {173844#false} assume !false; {173844#false} is VALID [2022-04-08 08:43:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:43:46,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:46,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18071653] [2022-04-08 08:43:46,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18071653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:46,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:46,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:46,266 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:46,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531708596] [2022-04-08 08:43:46,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531708596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:46,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:46,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:46,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010781876] [2022-04-08 08:43:46,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:46,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 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 205 [2022-04-08 08:43:46,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:46,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:46,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:46,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:46,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:46,382 INFO L87 Difference]: Start difference. First operand 1322 states and 1968 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:48,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:49,875 INFO L93 Difference]: Finished difference Result 2889 states and 4236 transitions. [2022-04-08 08:43:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:49,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 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 205 [2022-04-08 08:43:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:43:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-04-08 08:43:49,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-04-08 08:43:50,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:50,319 INFO L225 Difference]: With dead ends: 2889 [2022-04-08 08:43:50,319 INFO L226 Difference]: Without dead ends: 1583 [2022-04-08 08:43:50,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:50,321 INFO L913 BasicCegarLoop]: 105 mSDtfsCounter, 90 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:50,321 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 296 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:43:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2022-04-08 08:43:50,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1322. [2022-04-08 08:43:50,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:50,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:50,440 INFO L74 IsIncluded]: Start isIncluded. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:50,441 INFO L87 Difference]: Start difference. First operand 1583 states. Second operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:50,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:50,517 INFO L93 Difference]: Finished difference Result 1583 states and 2283 transitions. [2022-04-08 08:43:50,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2283 transitions. [2022-04-08 08:43:50,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:50,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:50,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 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 1583 states. [2022-04-08 08:43:50,521 INFO L87 Difference]: Start difference. First operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 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 1583 states. [2022-04-08 08:43:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:50,603 INFO L93 Difference]: Finished difference Result 1583 states and 2283 transitions. [2022-04-08 08:43:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2283 transitions. [2022-04-08 08:43:50,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:50,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:50,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:50,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1317 states have (on average 1.4874715261958997) internal successors, (1959), 1317 states have internal predecessors, (1959), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1963 transitions. [2022-04-08 08:43:50,707 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1963 transitions. Word has length 205 [2022-04-08 08:43:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:50,707 INFO L478 AbstractCegarLoop]: Abstraction has 1322 states and 1963 transitions. [2022-04-08 08:43:50,707 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:50,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1322 states and 1963 transitions. [2022-04-08 08:43:53,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1963 edges. 1963 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1963 transitions. [2022-04-08 08:43:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-08 08:43:53,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:43:53,018 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:43:53,018 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-08 08:43:53,018 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:43:53,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:43:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1752889520, now seen corresponding path program 1 times [2022-04-08 08:43:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:53,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [547641333] [2022-04-08 08:43:53,019 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:43:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1752889520, now seen corresponding path program 2 times [2022-04-08 08:43:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:43:53,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888471729] [2022-04-08 08:43:53,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:43:53,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:43:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:43:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:43:53,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {185450#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {185443#true} is VALID [2022-04-08 08:43:53,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {185443#true} assume true; {185443#true} is VALID [2022-04-08 08:43:53,229 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185443#true} {185443#true} #592#return; {185443#true} is VALID [2022-04-08 08:43:53,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {185443#true} call ULTIMATE.init(); {185450#(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-08 08:43:53,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {185450#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {185443#true} is VALID [2022-04-08 08:43:53,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {185443#true} assume true; {185443#true} is VALID [2022-04-08 08:43:53,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185443#true} {185443#true} #592#return; {185443#true} is VALID [2022-04-08 08:43:53,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {185443#true} call #t~ret159 := main(); {185443#true} is VALID [2022-04-08 08:43:53,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {185443#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {185443#true} is VALID [2022-04-08 08:43:53,230 INFO L272 TraceCheckUtils]: 6: Hoare triple {185443#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {185443#true} is VALID [2022-04-08 08:43:53,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {185443#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {185443#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; {185443#true} is VALID [2022-04-08 08:43:53,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {185443#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; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {185443#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {185443#true} assume 12292 == #t~mem43;havoc #t~mem43; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {185443#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; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {185443#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {185443#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {185443#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {185443#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {185443#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {185443#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-08 08:43:53,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 29: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {185443#true} assume 4368 == #t~mem48;havoc #t~mem48; {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {185443#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; {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {185443#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {185443#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; {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 47: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {185443#true} assume 4384 == #t~mem50;havoc #t~mem50; {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {185443#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {185443#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {185443#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 54: Hoare triple {185443#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 55: Hoare triple {185443#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 56: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 57: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 58: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 59: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 64: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 65: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 66: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 67: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {185443#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {185443#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 70: Hoare triple {185443#true} assume 4400 == #t~mem52;havoc #t~mem52; {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 72: Hoare triple {185443#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; {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 73: Hoare triple {185443#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 74: Hoare triple {185443#true} assume !(~ret~0 <= 0); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {185443#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 78: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 79: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 80: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,234 INFO L290 TraceCheckUtils]: 81: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 82: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 83: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 84: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 85: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 86: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 87: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 88: Hoare triple {185443#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 89: Hoare triple {185443#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 90: Hoare triple {185443#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 91: Hoare triple {185443#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 92: Hoare triple {185443#true} assume 4416 == #t~mem54;havoc #t~mem54; {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 93: Hoare triple {185443#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 94: Hoare triple {185443#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 95: Hoare triple {185443#true} 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; {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 96: Hoare triple {185443#true} assume !(0 == ~tmp___6~0); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 97: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 98: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-08 08:43:53,235 INFO L290 TraceCheckUtils]: 99: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 100: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 101: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 102: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 103: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 104: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 105: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 106: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 107: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 108: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 109: Hoare triple {185443#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 110: Hoare triple {185443#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 111: Hoare triple {185443#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 112: Hoare triple {185443#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 113: Hoare triple {185443#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 114: Hoare triple {185443#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 115: Hoare triple {185443#true} assume 4432 == #t~mem56;havoc #t~mem56; {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 116: Hoare triple {185443#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {185443#true} is VALID [2022-04-08 08:43:53,236 INFO L290 TraceCheckUtils]: 117: Hoare triple {185443#true} assume !(5 == ~blastFlag~0); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 118: Hoare triple {185443#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 119: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 120: Hoare triple {185443#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 121: Hoare triple {185443#true} ~skip~0 := 0; {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 122: Hoare triple {185443#true} assume !false; {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 123: Hoare triple {185443#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); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 124: Hoare triple {185443#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 125: Hoare triple {185443#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 126: Hoare triple {185443#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 127: Hoare triple {185443#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 128: Hoare triple {185443#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 129: Hoare triple {185443#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 130: Hoare triple {185443#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 131: Hoare triple {185443#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 132: Hoare triple {185443#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,237 INFO L290 TraceCheckUtils]: 133: Hoare triple {185443#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,238 INFO L290 TraceCheckUtils]: 134: Hoare triple {185443#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,238 INFO L290 TraceCheckUtils]: 135: Hoare triple {185443#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,238 INFO L290 TraceCheckUtils]: 136: Hoare triple {185443#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,238 INFO L290 TraceCheckUtils]: 137: Hoare triple {185443#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,238 INFO L290 TraceCheckUtils]: 138: Hoare triple {185443#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,238 INFO L290 TraceCheckUtils]: 139: Hoare triple {185443#true} assume 4448 == #t~mem58;havoc #t~mem58; {185443#true} is VALID [2022-04-08 08:43:53,238 INFO L290 TraceCheckUtils]: 140: Hoare triple {185443#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {185443#true} is VALID [2022-04-08 08:43:53,238 INFO L290 TraceCheckUtils]: 141: Hoare triple {185443#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {185443#true} is VALID [2022-04-08 08:43:53,238 INFO L290 TraceCheckUtils]: 142: Hoare triple {185443#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {185443#true} is VALID [2022-04-08 08:43:53,239 INFO L290 TraceCheckUtils]: 143: Hoare triple {185443#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,240 INFO L290 TraceCheckUtils]: 144: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,240 INFO L290 TraceCheckUtils]: 145: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,240 INFO L290 TraceCheckUtils]: 146: Hoare triple {185448#(not (= 4529 (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; {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,241 INFO L290 TraceCheckUtils]: 147: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,241 INFO L290 TraceCheckUtils]: 148: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,241 INFO L290 TraceCheckUtils]: 149: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,242 INFO L290 TraceCheckUtils]: 150: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,242 INFO L290 TraceCheckUtils]: 151: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,242 INFO L290 TraceCheckUtils]: 152: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,242 INFO L290 TraceCheckUtils]: 153: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,243 INFO L290 TraceCheckUtils]: 154: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,243 INFO L290 TraceCheckUtils]: 155: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,243 INFO L290 TraceCheckUtils]: 156: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,243 INFO L290 TraceCheckUtils]: 157: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,244 INFO L290 TraceCheckUtils]: 158: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,244 INFO L290 TraceCheckUtils]: 159: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,244 INFO L290 TraceCheckUtils]: 160: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,245 INFO L290 TraceCheckUtils]: 161: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,245 INFO L290 TraceCheckUtils]: 162: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,245 INFO L290 TraceCheckUtils]: 163: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,245 INFO L290 TraceCheckUtils]: 164: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,246 INFO L290 TraceCheckUtils]: 165: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,246 INFO L290 TraceCheckUtils]: 166: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,246 INFO L290 TraceCheckUtils]: 167: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,246 INFO L290 TraceCheckUtils]: 168: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,247 INFO L290 TraceCheckUtils]: 169: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,247 INFO L290 TraceCheckUtils]: 170: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,247 INFO L290 TraceCheckUtils]: 171: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,247 INFO L290 TraceCheckUtils]: 172: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,248 INFO L290 TraceCheckUtils]: 173: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,248 INFO L290 TraceCheckUtils]: 174: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,248 INFO L290 TraceCheckUtils]: 175: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,249 INFO L290 TraceCheckUtils]: 176: Hoare triple {185448#(not (= 4529 (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); {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:43:53,249 INFO L290 TraceCheckUtils]: 177: Hoare triple {185448#(not (= 4529 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4528 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {185449#(not (= |ssl3_connect_#t~mem71| 4529))} is VALID [2022-04-08 08:43:53,249 INFO L290 TraceCheckUtils]: 178: Hoare triple {185449#(not (= |ssl3_connect_#t~mem71| 4529))} assume 4529 == #t~mem71;havoc #t~mem71; {185444#false} is VALID [2022-04-08 08:43:53,249 INFO L290 TraceCheckUtils]: 179: Hoare triple {185444#false} assume -2147483648 <= #t~nondet123 && #t~nondet123 <= 2147483647;~ret~0 := #t~nondet123;havoc #t~nondet123; {185444#false} is VALID [2022-04-08 08:43:53,249 INFO L290 TraceCheckUtils]: 180: Hoare triple {185444#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); {185444#false} is VALID [2022-04-08 08:43:53,249 INFO L290 TraceCheckUtils]: 181: Hoare triple {185444#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; {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 182: Hoare triple {185444#false} call write~int(0, ~s.base, 64 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 183: Hoare triple {185444#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); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 184: Hoare triple {185444#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 185: Hoare triple {185444#false} ~skip~0 := 0; {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 186: Hoare triple {185444#false} assume !false; {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 187: Hoare triple {185444#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); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 188: Hoare triple {185444#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 189: Hoare triple {185444#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 190: Hoare triple {185444#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 191: Hoare triple {185444#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 192: Hoare triple {185444#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 193: Hoare triple {185444#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 194: Hoare triple {185444#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 195: Hoare triple {185444#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 196: Hoare triple {185444#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 197: Hoare triple {185444#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 198: Hoare triple {185444#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,250 INFO L290 TraceCheckUtils]: 199: Hoare triple {185444#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,251 INFO L290 TraceCheckUtils]: 200: Hoare triple {185444#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {185444#false} is VALID [2022-04-08 08:43:53,251 INFO L290 TraceCheckUtils]: 201: Hoare triple {185444#false} assume 4432 == #t~mem56;havoc #t~mem56; {185444#false} is VALID [2022-04-08 08:43:53,251 INFO L290 TraceCheckUtils]: 202: Hoare triple {185444#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {185444#false} is VALID [2022-04-08 08:43:53,251 INFO L290 TraceCheckUtils]: 203: Hoare triple {185444#false} assume 5 == ~blastFlag~0; {185444#false} is VALID [2022-04-08 08:43:53,251 INFO L290 TraceCheckUtils]: 204: Hoare triple {185444#false} assume !false; {185444#false} is VALID [2022-04-08 08:43:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:43:53,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:43:53,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888471729] [2022-04-08 08:43:53,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888471729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:53,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:53,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:53,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:43:53,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [547641333] [2022-04-08 08:43:53,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [547641333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:43:53,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:43:53,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:43:53,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543170922] [2022-04-08 08:43:53,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:43:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 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 205 [2022-04-08 08:43:53,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:43:53,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:53,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:53,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:43:53,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:43:53,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:43:53,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:43:53,346 INFO L87 Difference]: Start difference. First operand 1322 states and 1963 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:55,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:43:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:56,909 INFO L93 Difference]: Finished difference Result 2879 states and 4216 transitions. [2022-04-08 08:43:56,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:43:56,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 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 205 [2022-04-08 08:43:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:43:56,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 08:43:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 471 transitions. [2022-04-08 08:43:56,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 471 transitions. [2022-04-08 08:43:57,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:43:57,357 INFO L225 Difference]: With dead ends: 2879 [2022-04-08 08:43:57,357 INFO L226 Difference]: Without dead ends: 1573 [2022-04-08 08:43:57,359 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:43:57,359 INFO L913 BasicCegarLoop]: 100 mSDtfsCounter, 86 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 45 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:43:57,359 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 286 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:43:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-04-08 08:43:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1327. [2022-04-08 08:43:57,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:43:57,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,491 INFO L74 IsIncluded]: Start isIncluded. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,492 INFO L87 Difference]: Start difference. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:57,568 INFO L93 Difference]: Finished difference Result 1573 states and 2268 transitions. [2022-04-08 08:43:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2268 transitions. [2022-04-08 08:43:57,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:57,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:57,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 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 1573 states. [2022-04-08 08:43:57,572 INFO L87 Difference]: Start difference. First operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 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 1573 states. [2022-04-08 08:43:57,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:43:57,655 INFO L93 Difference]: Finished difference Result 1573 states and 2268 transitions. [2022-04-08 08:43:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2268 transitions. [2022-04-08 08:43:57,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:43:57,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:43:57,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:43:57,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:43:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1322 states have (on average 1.4856278366111952) internal successors, (1964), 1322 states have internal predecessors, (1964), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1968 transitions. [2022-04-08 08:43:57,736 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1968 transitions. Word has length 205 [2022-04-08 08:43:57,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:43:57,736 INFO L478 AbstractCegarLoop]: Abstraction has 1327 states and 1968 transitions. [2022-04-08 08:43:57,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:43:57,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1327 states and 1968 transitions. [2022-04-08 08:44:00,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1968 edges. 1968 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1968 transitions. [2022-04-08 08:44:00,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-08 08:44:00,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:00,111 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:00,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-08 08:44:00,111 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:00,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1208886526, now seen corresponding path program 1 times [2022-04-08 08:44:00,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:00,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [114121859] [2022-04-08 08:44:13,306 WARN L232 SmtUtils]: Spent 12.80s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:44:23,665 WARN L232 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-04-08 08:44:31,654 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:31,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1208886526, now seen corresponding path program 2 times [2022-04-08 08:44:31,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:31,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936823621] [2022-04-08 08:44:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:31,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:31,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:31,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {197020#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {197013#true} is VALID [2022-04-08 08:44:31,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {197013#true} assume true; {197013#true} is VALID [2022-04-08 08:44:31,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {197013#true} {197013#true} #592#return; {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {197013#true} call ULTIMATE.init(); {197020#(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-08 08:44:31,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {197020#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {197013#true} assume true; {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {197013#true} {197013#true} #592#return; {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {197013#true} call #t~ret159 := main(); {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {197013#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {197013#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {197013#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {197013#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; {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {197013#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; {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {197013#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-08 08:44:31,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {197013#true} assume 12292 == #t~mem43;havoc #t~mem43; {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {197013#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; {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {197013#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {197013#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {197013#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {197013#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {197013#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {197013#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {197013#true} assume 4368 == #t~mem48;havoc #t~mem48; {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {197013#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; {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 35: Hoare triple {197013#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 36: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {197013#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; {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 41: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {197013#true} assume 4384 == #t~mem50;havoc #t~mem50; {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {197013#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {197013#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 53: Hoare triple {197013#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {197013#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 55: Hoare triple {197013#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 60: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 61: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 62: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 63: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 64: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 65: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,877 INFO L290 TraceCheckUtils]: 66: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 67: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 68: Hoare triple {197013#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 69: Hoare triple {197013#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 70: Hoare triple {197013#true} assume 4400 == #t~mem52;havoc #t~mem52; {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 71: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {197013#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; {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 73: Hoare triple {197013#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 74: Hoare triple {197013#true} assume !(~ret~0 <= 0); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 75: Hoare triple {197013#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 77: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 78: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 79: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 80: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 81: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 82: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 83: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,878 INFO L290 TraceCheckUtils]: 84: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 85: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 86: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 87: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 88: Hoare triple {197013#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 89: Hoare triple {197013#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 90: Hoare triple {197013#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 91: Hoare triple {197013#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 92: Hoare triple {197013#true} assume 4416 == #t~mem54;havoc #t~mem54; {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 93: Hoare triple {197013#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 94: Hoare triple {197013#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 95: Hoare triple {197013#true} 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; {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 96: Hoare triple {197013#true} assume !(0 == ~tmp___6~0); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 97: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 98: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 99: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 100: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 101: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,879 INFO L290 TraceCheckUtils]: 102: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 103: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 104: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 105: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 106: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 107: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 108: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 109: Hoare triple {197013#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 110: Hoare triple {197013#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 111: Hoare triple {197013#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 112: Hoare triple {197013#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 113: Hoare triple {197013#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 114: Hoare triple {197013#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 115: Hoare triple {197013#true} assume 4432 == #t~mem56;havoc #t~mem56; {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 116: Hoare triple {197013#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 117: Hoare triple {197013#true} assume !(5 == ~blastFlag~0); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 118: Hoare triple {197013#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 119: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 120: Hoare triple {197013#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197013#true} is VALID [2022-04-08 08:44:31,880 INFO L290 TraceCheckUtils]: 121: Hoare triple {197013#true} ~skip~0 := 0; {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 122: Hoare triple {197013#true} assume !false; {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 123: Hoare triple {197013#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); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 124: Hoare triple {197013#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 125: Hoare triple {197013#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 126: Hoare triple {197013#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 127: Hoare triple {197013#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 128: Hoare triple {197013#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 129: Hoare triple {197013#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 130: Hoare triple {197013#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 131: Hoare triple {197013#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 132: Hoare triple {197013#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 133: Hoare triple {197013#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 134: Hoare triple {197013#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 135: Hoare triple {197013#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 136: Hoare triple {197013#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 137: Hoare triple {197013#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 138: Hoare triple {197013#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,881 INFO L290 TraceCheckUtils]: 139: Hoare triple {197013#true} assume 4448 == #t~mem58;havoc #t~mem58; {197013#true} is VALID [2022-04-08 08:44:31,882 INFO L290 TraceCheckUtils]: 140: Hoare triple {197013#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {197013#true} is VALID [2022-04-08 08:44:31,882 INFO L290 TraceCheckUtils]: 141: Hoare triple {197013#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {197013#true} is VALID [2022-04-08 08:44:31,882 INFO L290 TraceCheckUtils]: 142: Hoare triple {197013#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {197013#true} is VALID [2022-04-08 08:44:31,882 INFO L290 TraceCheckUtils]: 143: Hoare triple {197013#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,883 INFO L290 TraceCheckUtils]: 144: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,883 INFO L290 TraceCheckUtils]: 145: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,884 INFO L290 TraceCheckUtils]: 146: Hoare triple {197018#(not (= 4401 (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; {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,884 INFO L290 TraceCheckUtils]: 147: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,884 INFO L290 TraceCheckUtils]: 148: Hoare triple {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,885 INFO L290 TraceCheckUtils]: 149: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,885 INFO L290 TraceCheckUtils]: 150: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,885 INFO L290 TraceCheckUtils]: 151: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,886 INFO L290 TraceCheckUtils]: 152: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,886 INFO L290 TraceCheckUtils]: 153: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,886 INFO L290 TraceCheckUtils]: 154: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,887 INFO L290 TraceCheckUtils]: 155: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,887 INFO L290 TraceCheckUtils]: 156: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,887 INFO L290 TraceCheckUtils]: 157: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,888 INFO L290 TraceCheckUtils]: 158: Hoare triple {197018#(not (= 4401 (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); {197018#(not (= 4401 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:31,888 INFO L290 TraceCheckUtils]: 159: Hoare triple {197018#(not (= 4401 (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); {197019#(not (= |ssl3_connect_#t~mem53| 4401))} is VALID [2022-04-08 08:44:31,888 INFO L290 TraceCheckUtils]: 160: Hoare triple {197019#(not (= |ssl3_connect_#t~mem53| 4401))} assume 4401 == #t~mem53;havoc #t~mem53; {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 161: Hoare triple {197014#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); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 162: Hoare triple {197014#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;~skip~0 := 1; {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 163: Hoare triple {197014#false} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 164: Hoare triple {197014#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); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 165: Hoare triple {197014#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 166: Hoare triple {197014#false} ~skip~0 := 0; {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 167: Hoare triple {197014#false} assume !false; {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 168: Hoare triple {197014#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); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 169: Hoare triple {197014#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 170: Hoare triple {197014#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 171: Hoare triple {197014#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 172: Hoare triple {197014#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 173: Hoare triple {197014#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 174: Hoare triple {197014#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 175: Hoare triple {197014#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 176: Hoare triple {197014#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 177: Hoare triple {197014#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,889 INFO L290 TraceCheckUtils]: 178: Hoare triple {197014#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 179: Hoare triple {197014#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 180: Hoare triple {197014#false} assume 4416 == #t~mem54;havoc #t~mem54; {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 181: Hoare triple {197014#false} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 182: Hoare triple {197014#false} assume !(3 == ~blastFlag~0); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 183: Hoare triple {197014#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; {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 184: Hoare triple {197014#false} assume !(0 == ~tmp___6~0); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 185: Hoare triple {197014#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); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 186: Hoare triple {197014#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 187: Hoare triple {197014#false} ~skip~0 := 0; {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 188: Hoare triple {197014#false} assume !false; {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 189: Hoare triple {197014#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); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 190: Hoare triple {197014#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 191: Hoare triple {197014#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 192: Hoare triple {197014#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 193: Hoare triple {197014#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 194: Hoare triple {197014#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 195: Hoare triple {197014#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,890 INFO L290 TraceCheckUtils]: 196: Hoare triple {197014#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 197: Hoare triple {197014#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 198: Hoare triple {197014#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 199: Hoare triple {197014#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 200: Hoare triple {197014#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 201: Hoare triple {197014#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 202: Hoare triple {197014#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 203: Hoare triple {197014#false} assume 4432 == #t~mem56;havoc #t~mem56; {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 204: Hoare triple {197014#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 205: Hoare triple {197014#false} assume 5 == ~blastFlag~0; {197014#false} is VALID [2022-04-08 08:44:31,891 INFO L290 TraceCheckUtils]: 206: Hoare triple {197014#false} assume !false; {197014#false} is VALID [2022-04-08 08:44:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2022-04-08 08:44:31,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:31,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936823621] [2022-04-08 08:44:31,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936823621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:31,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:31,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:31,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:31,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [114121859] [2022-04-08 08:44:31,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [114121859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:31,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:31,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155050845] [2022-04-08 08:44:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:31,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 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 207 [2022-04-08 08:44:31,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:31,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:31,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:31,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:31,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:31,975 INFO L87 Difference]: Start difference. First operand 1327 states and 1968 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:33,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:35,557 INFO L93 Difference]: Finished difference Result 2884 states and 4216 transitions. [2022-04-08 08:44:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 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 207 [2022-04-08 08:44:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-08 08:44:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:35,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2022-04-08 08:44:35,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 470 transitions. [2022-04-08 08:44:35,881 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-08 08:44:35,990 INFO L225 Difference]: With dead ends: 2884 [2022-04-08 08:44:35,990 INFO L226 Difference]: Without dead ends: 1573 [2022-04-08 08:44:35,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:35,992 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 103 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:35,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 298 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 388 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:44:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2022-04-08 08:44:36,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1327. [2022-04-08 08:44:36,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:36,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:36,137 INFO L74 IsIncluded]: Start isIncluded. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:36,138 INFO L87 Difference]: Start difference. First operand 1573 states. Second operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:36,217 INFO L93 Difference]: Finished difference Result 1573 states and 2253 transitions. [2022-04-08 08:44:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2253 transitions. [2022-04-08 08:44:36,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:36,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:36,220 INFO L74 IsIncluded]: Start isIncluded. First operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 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 1573 states. [2022-04-08 08:44:36,221 INFO L87 Difference]: Start difference. First operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 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 1573 states. [2022-04-08 08:44:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:36,295 INFO L93 Difference]: Finished difference Result 1573 states and 2253 transitions. [2022-04-08 08:44:36,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2253 transitions. [2022-04-08 08:44:36,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:36,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:36,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:36,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1322 states have (on average 1.4742813918305597) internal successors, (1949), 1322 states have internal predecessors, (1949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1953 transitions. [2022-04-08 08:44:36,375 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1953 transitions. Word has length 207 [2022-04-08 08:44:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:36,375 INFO L478 AbstractCegarLoop]: Abstraction has 1327 states and 1953 transitions. [2022-04-08 08:44:36,375 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:36,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1327 states and 1953 transitions. [2022-04-08 08:44:38,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1953 edges. 1953 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:38,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1953 transitions. [2022-04-08 08:44:38,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-08 08:44:38,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:38,881 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:38,882 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-08 08:44:38,882 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:38,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:38,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1171434757, now seen corresponding path program 1 times [2022-04-08 08:44:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:38,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112419569] [2022-04-08 08:44:38,883 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:38,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1171434757, now seen corresponding path program 2 times [2022-04-08 08:44:38,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:38,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070267744] [2022-04-08 08:44:38,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:38,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:39,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:39,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:39,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {208600#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {208593#true} is VALID [2022-04-08 08:44:39,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {208593#true} assume true; {208593#true} is VALID [2022-04-08 08:44:39,107 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {208593#true} {208593#true} #592#return; {208593#true} is VALID [2022-04-08 08:44:39,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {208593#true} call ULTIMATE.init(); {208600#(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-08 08:44:39,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {208600#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {208593#true} is VALID [2022-04-08 08:44:39,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {208593#true} assume true; {208593#true} is VALID [2022-04-08 08:44:39,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {208593#true} {208593#true} #592#return; {208593#true} is VALID [2022-04-08 08:44:39,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {208593#true} call #t~ret159 := main(); {208593#true} is VALID [2022-04-08 08:44:39,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {208593#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {208593#true} is VALID [2022-04-08 08:44:39,108 INFO L272 TraceCheckUtils]: 6: Hoare triple {208593#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {208593#true} is VALID [2022-04-08 08:44:39,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {208593#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {208593#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; {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {208593#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; {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {208593#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {208593#true} assume 12292 == #t~mem43;havoc #t~mem43; {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {208593#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; {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {208593#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {208593#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {208593#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {208593#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {208593#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {208593#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {208593#true} assume 4368 == #t~mem48;havoc #t~mem48; {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {208593#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; {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {208593#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {208593#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; {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 38: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 39: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 43: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 44: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,111 INFO L290 TraceCheckUtils]: 45: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 46: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 47: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 48: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 49: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {208593#true} assume 4384 == #t~mem50;havoc #t~mem50; {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {208593#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {208593#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {208593#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 54: Hoare triple {208593#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 55: Hoare triple {208593#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 56: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,112 INFO L290 TraceCheckUtils]: 57: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 58: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 59: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 60: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 61: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 62: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 63: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {208593#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {208593#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {208593#true} assume 4400 == #t~mem52;havoc #t~mem52; {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 71: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 72: Hoare triple {208593#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; {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 73: Hoare triple {208593#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 74: Hoare triple {208593#true} assume !(~ret~0 <= 0); {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 75: Hoare triple {208593#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 77: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 78: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 79: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 80: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 81: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 82: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,114 INFO L290 TraceCheckUtils]: 83: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 84: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 85: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 86: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 87: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 88: Hoare triple {208593#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 89: Hoare triple {208593#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 90: Hoare triple {208593#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 91: Hoare triple {208593#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 92: Hoare triple {208593#true} assume 4416 == #t~mem54;havoc #t~mem54; {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 93: Hoare triple {208593#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 94: Hoare triple {208593#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {208593#true} is VALID [2022-04-08 08:44:39,115 INFO L290 TraceCheckUtils]: 95: Hoare triple {208593#true} 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; {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 96: Hoare triple {208593#true} assume !(0 == ~tmp___6~0); {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 97: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 98: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 99: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 100: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 101: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 102: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 103: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 104: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 105: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 106: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 107: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,116 INFO L290 TraceCheckUtils]: 108: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 109: Hoare triple {208593#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 110: Hoare triple {208593#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 111: Hoare triple {208593#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 112: Hoare triple {208593#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 113: Hoare triple {208593#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 114: Hoare triple {208593#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 115: Hoare triple {208593#true} assume 4432 == #t~mem56;havoc #t~mem56; {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 116: Hoare triple {208593#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 117: Hoare triple {208593#true} assume !(5 == ~blastFlag~0); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 118: Hoare triple {208593#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 119: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 120: Hoare triple {208593#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208593#true} is VALID [2022-04-08 08:44:39,117 INFO L290 TraceCheckUtils]: 121: Hoare triple {208593#true} ~skip~0 := 0; {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 122: Hoare triple {208593#true} assume !false; {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 123: Hoare triple {208593#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); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 124: Hoare triple {208593#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 125: Hoare triple {208593#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 126: Hoare triple {208593#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 127: Hoare triple {208593#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 128: Hoare triple {208593#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 129: Hoare triple {208593#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 130: Hoare triple {208593#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 131: Hoare triple {208593#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 132: Hoare triple {208593#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 133: Hoare triple {208593#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,118 INFO L290 TraceCheckUtils]: 134: Hoare triple {208593#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,119 INFO L290 TraceCheckUtils]: 135: Hoare triple {208593#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,119 INFO L290 TraceCheckUtils]: 136: Hoare triple {208593#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,119 INFO L290 TraceCheckUtils]: 137: Hoare triple {208593#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,119 INFO L290 TraceCheckUtils]: 138: Hoare triple {208593#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,119 INFO L290 TraceCheckUtils]: 139: Hoare triple {208593#true} assume 4448 == #t~mem58;havoc #t~mem58; {208593#true} is VALID [2022-04-08 08:44:39,119 INFO L290 TraceCheckUtils]: 140: Hoare triple {208593#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {208593#true} is VALID [2022-04-08 08:44:39,119 INFO L290 TraceCheckUtils]: 141: Hoare triple {208593#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {208593#true} is VALID [2022-04-08 08:44:39,119 INFO L290 TraceCheckUtils]: 142: Hoare triple {208593#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {208593#true} is VALID [2022-04-08 08:44:39,120 INFO L290 TraceCheckUtils]: 143: Hoare triple {208593#true} assume 0 != #t~mem99;havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4464, ~s.base, 52 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,121 INFO L290 TraceCheckUtils]: 144: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,121 INFO L290 TraceCheckUtils]: 145: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,121 INFO L290 TraceCheckUtils]: 146: Hoare triple {208598#(= 4464 (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; {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,122 INFO L290 TraceCheckUtils]: 147: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} ~skip~0 := 0; {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,122 INFO L290 TraceCheckUtils]: 148: Hoare triple {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} assume !false; {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,123 INFO L290 TraceCheckUtils]: 149: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,123 INFO L290 TraceCheckUtils]: 150: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,123 INFO L290 TraceCheckUtils]: 151: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,124 INFO L290 TraceCheckUtils]: 152: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,124 INFO L290 TraceCheckUtils]: 153: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,124 INFO L290 TraceCheckUtils]: 154: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,125 INFO L290 TraceCheckUtils]: 155: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,125 INFO L290 TraceCheckUtils]: 156: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,126 INFO L290 TraceCheckUtils]: 157: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,126 INFO L290 TraceCheckUtils]: 158: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,126 INFO L290 TraceCheckUtils]: 159: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,127 INFO L290 TraceCheckUtils]: 160: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,127 INFO L290 TraceCheckUtils]: 161: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,128 INFO L290 TraceCheckUtils]: 162: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,128 INFO L290 TraceCheckUtils]: 163: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,128 INFO L290 TraceCheckUtils]: 164: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,129 INFO L290 TraceCheckUtils]: 165: Hoare triple {208598#(= 4464 (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); {208598#(= 4464 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset)))} is VALID [2022-04-08 08:44:39,129 INFO L290 TraceCheckUtils]: 166: Hoare triple {208598#(= 4464 (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); {208599#(= |ssl3_connect_#t~mem60| 4464)} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 167: Hoare triple {208599#(= |ssl3_connect_#t~mem60| 4464)} assume !(4464 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 168: Hoare triple {208594#false} assume !(4465 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 169: Hoare triple {208594#false} assume !(4466 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 170: Hoare triple {208594#false} assume !(4467 == #t~mem63);havoc #t~mem63;call #t~mem64 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 171: Hoare triple {208594#false} assume !(4480 == #t~mem64);havoc #t~mem64;call #t~mem65 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 172: Hoare triple {208594#false} assume !(4481 == #t~mem65);havoc #t~mem65;call #t~mem66 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 173: Hoare triple {208594#false} assume !(4496 == #t~mem66);havoc #t~mem66;call #t~mem67 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 174: Hoare triple {208594#false} assume !(4497 == #t~mem67);havoc #t~mem67;call #t~mem68 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 175: Hoare triple {208594#false} assume !(4512 == #t~mem68);havoc #t~mem68;call #t~mem69 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 176: Hoare triple {208594#false} assume !(4513 == #t~mem69);havoc #t~mem69;call #t~mem70 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 177: Hoare triple {208594#false} assume !(4528 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,130 INFO L290 TraceCheckUtils]: 178: Hoare triple {208594#false} assume !(4529 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 179: Hoare triple {208594#false} assume !(4560 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 180: Hoare triple {208594#false} assume !(4561 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 181: Hoare triple {208594#false} assume 4352 == #t~mem74;havoc #t~mem74; {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 182: Hoare triple {208594#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~num1~0 := #t~nondet136;havoc #t~nondet136; {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 183: Hoare triple {208594#false} assume !(~num1~0 > 0); {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 184: Hoare triple {208594#false} call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem139 := read~int(#t~mem138.base, 844 + #t~mem138.offset, 4);call write~int(#t~mem139, ~s.base, 52 + ~s.offset, 4);havoc #t~mem138.base, #t~mem138.offset;havoc #t~mem139; {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 185: Hoare triple {208594#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); {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 186: Hoare triple {208594#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 187: Hoare triple {208594#false} ~skip~0 := 0; {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 188: Hoare triple {208594#false} assume !false; {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 189: Hoare triple {208594#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); {208594#false} is VALID [2022-04-08 08:44:39,131 INFO L290 TraceCheckUtils]: 190: Hoare triple {208594#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 191: Hoare triple {208594#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 192: Hoare triple {208594#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 193: Hoare triple {208594#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 194: Hoare triple {208594#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 195: Hoare triple {208594#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 196: Hoare triple {208594#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 197: Hoare triple {208594#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 198: Hoare triple {208594#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 199: Hoare triple {208594#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 200: Hoare triple {208594#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,132 INFO L290 TraceCheckUtils]: 201: Hoare triple {208594#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,133 INFO L290 TraceCheckUtils]: 202: Hoare triple {208594#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {208594#false} is VALID [2022-04-08 08:44:39,133 INFO L290 TraceCheckUtils]: 203: Hoare triple {208594#false} assume 4432 == #t~mem56;havoc #t~mem56; {208594#false} is VALID [2022-04-08 08:44:39,133 INFO L290 TraceCheckUtils]: 204: Hoare triple {208594#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {208594#false} is VALID [2022-04-08 08:44:39,133 INFO L290 TraceCheckUtils]: 205: Hoare triple {208594#false} assume 5 == ~blastFlag~0; {208594#false} is VALID [2022-04-08 08:44:39,133 INFO L290 TraceCheckUtils]: 206: Hoare triple {208594#false} assume !false; {208594#false} is VALID [2022-04-08 08:44:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:44:39,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:39,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070267744] [2022-04-08 08:44:39,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070267744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:39,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:39,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:39,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:39,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112419569] [2022-04-08 08:44:39,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112419569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:39,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:39,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6868980] [2022-04-08 08:44:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:39,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 207 [2022-04-08 08:44:39,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:39,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:39,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:39,228 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:39,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:39,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:39,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:39,228 INFO L87 Difference]: Start difference. First operand 1327 states and 1953 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:41,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:42,743 INFO L93 Difference]: Finished difference Result 2842 states and 4161 transitions. [2022-04-08 08:44:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:42,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 207 [2022-04-08 08:44:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-04-08 08:44:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:42,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2022-04-08 08:44:42,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 408 transitions. [2022-04-08 08:44:43,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 408 edges. 408 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:43,114 INFO L225 Difference]: With dead ends: 2842 [2022-04-08 08:44:43,114 INFO L226 Difference]: Without dead ends: 1531 [2022-04-08 08:44:43,116 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:43,116 INFO L913 BasicCegarLoop]: 205 mSDtfsCounter, 35 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:43,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 502 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 410 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:44:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-04-08 08:44:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1443. [2022-04-08 08:44:43,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:43,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1531 states. Second operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,249 INFO L74 IsIncluded]: Start isIncluded. First operand 1531 states. Second operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,250 INFO L87 Difference]: Start difference. First operand 1531 states. Second operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:43,314 INFO L93 Difference]: Finished difference Result 1531 states and 2224 transitions. [2022-04-08 08:44:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2224 transitions. [2022-04-08 08:44:43,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:43,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:43,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 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 1531 states. [2022-04-08 08:44:43,318 INFO L87 Difference]: Start difference. First operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 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 1531 states. [2022-04-08 08:44:43,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:43,384 INFO L93 Difference]: Finished difference Result 1531 states and 2224 transitions. [2022-04-08 08:44:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 2224 transitions. [2022-04-08 08:44:43,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:43,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:43,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:43,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1443 states, 1438 states have (on average 1.4694019471488178) internal successors, (2113), 1438 states have internal predecessors, (2113), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2117 transitions. [2022-04-08 08:44:43,495 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 2117 transitions. Word has length 207 [2022-04-08 08:44:43,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:43,495 INFO L478 AbstractCegarLoop]: Abstraction has 1443 states and 2117 transitions. [2022-04-08 08:44:43,495 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:43,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1443 states and 2117 transitions. [2022-04-08 08:44:46,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2117 edges. 2117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 2117 transitions. [2022-04-08 08:44:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-08 08:44:46,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:46,104 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:46,104 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-08 08:44:46,104 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:46,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1117041859, now seen corresponding path program 1 times [2022-04-08 08:44:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:46,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [424509449] [2022-04-08 08:44:46,105 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 08:44:46,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1117041859, now seen corresponding path program 2 times [2022-04-08 08:44:46,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:44:46,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131346185] [2022-04-08 08:44:46,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:44:46,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:44:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:46,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:44:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:44:46,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {220244#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {220237#true} is VALID [2022-04-08 08:44:46,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {220237#true} assume true; {220237#true} is VALID [2022-04-08 08:44:46,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {220237#true} {220237#true} #592#return; {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {220237#true} call ULTIMATE.init(); {220244#(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-08 08:44:46,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {220244#(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(27, 2);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_$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);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#SSLv3_client_data~0.base); {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {220237#true} assume true; {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {220237#true} {220237#true} #592#return; {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {220237#true} call #t~ret159 := main(); {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {220237#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(248);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(899);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 84 + ~s~0.offset, 4);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(232);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 204 + ~s~0.offset, 4);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(200);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 176 + ~s~0.offset, 4);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 52 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;call write~int(#t~nondet11, ~s~0.base, ~s~0.offset, 4);havoc #t~nondet11;call write~$Pointer$(0, (if #t~nondet12 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet12 % 4294967296 % 4294967296 else #t~nondet12 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 192 + ~s~0.offset, 4);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 204 + ~s~0.offset, 4);call write~$Pointer$(0, (if #t~nondet14 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet14 % 4294967296 % 4294967296 else #t~nondet14 % 4294967296 % 4294967296 - 4294967296), #t~mem13.base, 108 + #t~mem13.offset, 4);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet15 % 4294967296 % 4294967296 else #t~nondet15 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 60 + ~s~0.offset, 4);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet16 % 4294967296 % 4294967296 else #t~nondet16 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 20 + ~s~0.offset, 4);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet17 % 4294967296 % 4294967296 else #t~nondet17 % 4294967296 % 4294967296 - 4294967296), ~s~0.base, 16 + ~s~0.offset, 4);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, #t~mem18.offset, 4);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 852 + #t~mem20.offset, 4);havoc #t~mem20.base, #t~mem20.offset;havoc #t~nondet21;call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(40);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 836 + #t~mem22.offset, 4);havoc #t~mem22.base, #t~mem22.offset;havoc #t~malloc23.base, #t~malloc23.offset;call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 836 + #t~mem24.offset, 4);call write~int(#t~nondet26, #t~mem25.base, 12 + #t~mem25.offset, 4);havoc #t~mem24.base, #t~mem24.offset;havoc #t~mem25.base, #t~mem25.offset;havoc #t~nondet26;call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~s~0.base, 84 + ~s~0.offset, 4);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 844 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L272 TraceCheckUtils]: 6: Hoare triple {220237#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {220237#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~buf~0.base, ~buf~0.offset := 0, (if #t~nondet30 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet30 % 4294967296 % 4294967296 else #t~nondet30 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet30;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;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___1~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___2~0 := #t~nondet32;havoc #t~nondet32;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;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;call write~int(#t~nondet33, ~s.base, 92 + ~s.offset, 4);havoc #t~nondet33;call write~int(12292, ~s.base, 52 + ~s.offset, 4);assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp~2 := #t~nondet34;havoc #t~nondet34;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~s.base, 192 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {220237#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; {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {220237#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; {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {220237#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {220237#true} is VALID [2022-04-08 08:44:46,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {220237#true} assume 12292 == #t~mem43;havoc #t~mem43; {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {220237#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; {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {220237#true} call write~int(0, ~s.base, 36 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {220237#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 4294967296; {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {220237#true} call #t~mem78 := read~int(~s.base, ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {220237#true} assume !(0 == (#t~mem79.base + #t~mem79.offset) % 4294967296);havoc #t~mem79.base, #t~mem79.offset; {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {220237#true} assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~tmp___4~0 := #t~nondet81;havoc #t~nondet81; {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {220237#true} assume !(0 == ~tmp___4~0);assume -2147483648 <= #t~nondet82 && #t~nondet82 <= 2147483647;~tmp___5~0 := #t~nondet82;havoc #t~nondet82; {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 28: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {220237#true} assume 4368 == #t~mem48;havoc #t~mem48; {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {220237#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; {220237#true} is VALID [2022-04-08 08:44:46,315 INFO L290 TraceCheckUtils]: 35: Hoare triple {220237#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 36: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {220237#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; {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 39: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 40: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 41: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {220237#true} assume 4384 == #t~mem50;havoc #t~mem50; {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {220237#true} assume -2147483648 <= #t~nondet88 && #t~nondet88 <= 2147483647;~ret~0 := #t~nondet88;havoc #t~nondet88; {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {220237#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {220237#true} assume !(~ret~0 <= 0);call #t~mem89 := read~int(~s.base, 92 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {220237#true} assume !(0 != #t~mem89);havoc #t~mem89;call write~int(4400, ~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {220237#true} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 56: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 58: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 59: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,317 INFO L290 TraceCheckUtils]: 61: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 62: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 63: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 64: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 65: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 66: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 67: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 68: Hoare triple {220237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 69: Hoare triple {220237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 70: Hoare triple {220237#true} assume 4400 == #t~mem52;havoc #t~mem52; {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 71: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 72: Hoare triple {220237#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; {220237#true} is VALID [2022-04-08 08:44:46,318 INFO L290 TraceCheckUtils]: 73: Hoare triple {220237#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 74: Hoare triple {220237#true} assume !(~ret~0 <= 0); {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 75: Hoare triple {220237#true} call write~int(4416, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 76: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 77: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 78: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 79: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 80: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 81: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 82: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 83: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 84: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,319 INFO L290 TraceCheckUtils]: 85: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 86: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 87: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 88: Hoare triple {220237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 89: Hoare triple {220237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 90: Hoare triple {220237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 91: Hoare triple {220237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 92: Hoare triple {220237#true} assume 4416 == #t~mem54;havoc #t~mem54; {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 93: Hoare triple {220237#true} assume -2147483648 <= #t~nondet94 && #t~nondet94 <= 2147483647;~ret~0 := #t~nondet94;havoc #t~nondet94; {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 94: Hoare triple {220237#true} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 95: Hoare triple {220237#true} 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; {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 96: Hoare triple {220237#true} assume !(0 == ~tmp___6~0); {220237#true} is VALID [2022-04-08 08:44:46,320 INFO L290 TraceCheckUtils]: 97: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 98: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 99: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 100: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 101: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 102: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 103: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 104: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 105: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 106: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 107: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 108: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,321 INFO L290 TraceCheckUtils]: 109: Hoare triple {220237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 110: Hoare triple {220237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 111: Hoare triple {220237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 112: Hoare triple {220237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 113: Hoare triple {220237#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 114: Hoare triple {220237#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 115: Hoare triple {220237#true} assume 4432 == #t~mem56;havoc #t~mem56; {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 116: Hoare triple {220237#true} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 117: Hoare triple {220237#true} assume !(5 == ~blastFlag~0); {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 118: Hoare triple {220237#true} assume !(~ret~0 <= 0);call write~int(4448, ~s.base, 52 + ~s.offset, 4);call write~int(0, ~s.base, 64 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 119: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 120: Hoare triple {220237#true} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220237#true} is VALID [2022-04-08 08:44:46,322 INFO L290 TraceCheckUtils]: 121: Hoare triple {220237#true} ~skip~0 := 0; {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 122: Hoare triple {220237#true} assume !false; {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 123: Hoare triple {220237#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); {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 124: Hoare triple {220237#true} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 125: Hoare triple {220237#true} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 126: Hoare triple {220237#true} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 127: Hoare triple {220237#true} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 128: Hoare triple {220237#true} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 129: Hoare triple {220237#true} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 130: Hoare triple {220237#true} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 131: Hoare triple {220237#true} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,323 INFO L290 TraceCheckUtils]: 132: Hoare triple {220237#true} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 133: Hoare triple {220237#true} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 134: Hoare triple {220237#true} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 135: Hoare triple {220237#true} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 136: Hoare triple {220237#true} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 137: Hoare triple {220237#true} assume !(4432 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 138: Hoare triple {220237#true} assume !(4433 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 52 + ~s.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 139: Hoare triple {220237#true} assume 4448 == #t~mem58;havoc #t~mem58; {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 140: Hoare triple {220237#true} assume -2147483648 <= #t~nondet97 && #t~nondet97 <= 2147483647;~ret~0 := #t~nondet97;havoc #t~nondet97; {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 141: Hoare triple {220237#true} assume 4 == ~blastFlag~0;~blastFlag~0 := 5; {220237#true} is VALID [2022-04-08 08:44:46,324 INFO L290 TraceCheckUtils]: 142: Hoare triple {220237#true} assume !(~ret~0 <= 0);call #t~mem98.base, #t~mem98.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem99 := read~int(#t~mem98.base, 852 + #t~mem98.offset, 4); {220237#true} is VALID [2022-04-08 08:44:46,325 INFO L290 TraceCheckUtils]: 143: Hoare triple {220237#true} assume !(0 != #t~mem99);havoc #t~mem98.base, #t~mem98.offset;havoc #t~mem99;call write~int(4480, ~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,326 INFO L290 TraceCheckUtils]: 144: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} call write~int(0, ~s.base, 64 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,326 INFO L290 TraceCheckUtils]: 145: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,326 INFO L290 TraceCheckUtils]: 146: Hoare triple {220242#(not (= 4352 (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; {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,326 INFO L290 TraceCheckUtils]: 147: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} ~skip~0 := 0; {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,327 INFO L290 TraceCheckUtils]: 148: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !false; {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,327 INFO L290 TraceCheckUtils]: 149: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,327 INFO L290 TraceCheckUtils]: 150: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,327 INFO L290 TraceCheckUtils]: 151: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,328 INFO L290 TraceCheckUtils]: 152: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,328 INFO L290 TraceCheckUtils]: 153: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,328 INFO L290 TraceCheckUtils]: 154: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,329 INFO L290 TraceCheckUtils]: 155: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,329 INFO L290 TraceCheckUtils]: 156: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,329 INFO L290 TraceCheckUtils]: 157: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,329 INFO L290 TraceCheckUtils]: 158: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,330 INFO L290 TraceCheckUtils]: 159: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,330 INFO L290 TraceCheckUtils]: 160: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,330 INFO L290 TraceCheckUtils]: 161: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,330 INFO L290 TraceCheckUtils]: 162: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,331 INFO L290 TraceCheckUtils]: 163: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,331 INFO L290 TraceCheckUtils]: 164: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,355 INFO L290 TraceCheckUtils]: 165: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,355 INFO L290 TraceCheckUtils]: 166: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,355 INFO L290 TraceCheckUtils]: 167: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,356 INFO L290 TraceCheckUtils]: 168: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,356 INFO L290 TraceCheckUtils]: 169: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,356 INFO L290 TraceCheckUtils]: 170: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,356 INFO L290 TraceCheckUtils]: 171: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,357 INFO L290 TraceCheckUtils]: 172: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,357 INFO L290 TraceCheckUtils]: 173: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,357 INFO L290 TraceCheckUtils]: 174: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,358 INFO L290 TraceCheckUtils]: 175: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,358 INFO L290 TraceCheckUtils]: 176: Hoare triple {220242#(not (= 4352 (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); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,358 INFO L290 TraceCheckUtils]: 177: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4528 == #t~mem70);havoc #t~mem70;call #t~mem71 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,358 INFO L290 TraceCheckUtils]: 178: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4529 == #t~mem71);havoc #t~mem71;call #t~mem72 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,359 INFO L290 TraceCheckUtils]: 179: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4560 == #t~mem72);havoc #t~mem72;call #t~mem73 := read~int(~s.base, 52 + ~s.offset, 4); {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} is VALID [2022-04-08 08:44:46,359 INFO L290 TraceCheckUtils]: 180: Hoare triple {220242#(not (= 4352 (select (select |#memory_int| ssl3_connect_~s.base) (+ 52 ssl3_connect_~s.offset))))} assume !(4561 == #t~mem73);havoc #t~mem73;call #t~mem74 := read~int(~s.base, 52 + ~s.offset, 4); {220243#(not (= 4352 |ssl3_connect_#t~mem74|))} is VALID [2022-04-08 08:44:46,359 INFO L290 TraceCheckUtils]: 181: Hoare triple {220243#(not (= 4352 |ssl3_connect_#t~mem74|))} assume 4352 == #t~mem74;havoc #t~mem74; {220238#false} is VALID [2022-04-08 08:44:46,359 INFO L290 TraceCheckUtils]: 182: Hoare triple {220238#false} assume -2147483648 <= #t~nondet136 && #t~nondet136 <= 2147483647;~num1~0 := #t~nondet136;havoc #t~nondet136; {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 183: Hoare triple {220238#false} assume !(~num1~0 > 0); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 184: Hoare triple {220238#false} call #t~mem138.base, #t~mem138.offset := read~$Pointer$(~s.base, 84 + ~s.offset, 4);call #t~mem139 := read~int(#t~mem138.base, 844 + #t~mem138.offset, 4);call write~int(#t~mem139, ~s.base, 52 + ~s.offset, 4);havoc #t~mem138.base, #t~mem138.offset;havoc #t~mem139; {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 185: Hoare triple {220238#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); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 186: Hoare triple {220238#false} assume !(0 == #t~mem149);havoc #t~mem148.base, #t~mem148.offset;havoc #t~mem149; {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 187: Hoare triple {220238#false} ~skip~0 := 0; {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 188: Hoare triple {220238#false} assume !false; {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 189: Hoare triple {220238#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); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 190: Hoare triple {220238#false} assume !(12292 == #t~mem43);havoc #t~mem43;call #t~mem44 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 191: Hoare triple {220238#false} assume !(16384 == #t~mem44);havoc #t~mem44;call #t~mem45 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 192: Hoare triple {220238#false} assume !(4096 == #t~mem45);havoc #t~mem45;call #t~mem46 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 193: Hoare triple {220238#false} assume !(20480 == #t~mem46);havoc #t~mem46;call #t~mem47 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 194: Hoare triple {220238#false} assume !(4099 == #t~mem47);havoc #t~mem47;call #t~mem48 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 195: Hoare triple {220238#false} assume !(4368 == #t~mem48);havoc #t~mem48;call #t~mem49 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 196: Hoare triple {220238#false} assume !(4369 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 197: Hoare triple {220238#false} assume !(4384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 198: Hoare triple {220238#false} assume !(4385 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,360 INFO L290 TraceCheckUtils]: 199: Hoare triple {220238#false} assume !(4400 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,361 INFO L290 TraceCheckUtils]: 200: Hoare triple {220238#false} assume !(4401 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,361 INFO L290 TraceCheckUtils]: 201: Hoare triple {220238#false} assume !(4416 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,361 INFO L290 TraceCheckUtils]: 202: Hoare triple {220238#false} assume !(4417 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 52 + ~s.offset, 4); {220238#false} is VALID [2022-04-08 08:44:46,361 INFO L290 TraceCheckUtils]: 203: Hoare triple {220238#false} assume 4432 == #t~mem56;havoc #t~mem56; {220238#false} is VALID [2022-04-08 08:44:46,361 INFO L290 TraceCheckUtils]: 204: Hoare triple {220238#false} assume -2147483648 <= #t~nondet96 && #t~nondet96 <= 2147483647;~ret~0 := #t~nondet96;havoc #t~nondet96; {220238#false} is VALID [2022-04-08 08:44:46,361 INFO L290 TraceCheckUtils]: 205: Hoare triple {220238#false} assume 5 == ~blastFlag~0; {220238#false} is VALID [2022-04-08 08:44:46,361 INFO L290 TraceCheckUtils]: 206: Hoare triple {220238#false} assume !false; {220238#false} is VALID [2022-04-08 08:44:46,361 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2022-04-08 08:44:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:44:46,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131346185] [2022-04-08 08:44:46,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131346185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:46,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:46,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:46,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:44:46,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [424509449] [2022-04-08 08:44:46,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [424509449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:44:46,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:44:46,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:44:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997518947] [2022-04-08 08:44:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:44:46,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 207 [2022-04-08 08:44:46,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:44:46,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:46,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:46,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:44:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:46,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:44:46,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:44:46,466 INFO L87 Difference]: Start difference. First operand 1443 states and 2117 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:48,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-08 08:44:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:50,096 INFO L93 Difference]: Finished difference Result 3096 states and 4489 transitions. [2022-04-08 08:44:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:44:50,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 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 207 [2022-04-08 08:44:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:44:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-08 08:44:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 464 transitions. [2022-04-08 08:44:50,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 464 transitions. [2022-04-08 08:44:50,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 464 edges. 464 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:50,544 INFO L225 Difference]: With dead ends: 3096 [2022-04-08 08:44:50,544 INFO L226 Difference]: Without dead ends: 1664 [2022-04-08 08:44:50,546 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:44:50,546 INFO L913 BasicCegarLoop]: 103 mSDtfsCounter, 80 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 08:44:50,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 292 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 376 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 08:44:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2022-04-08 08:44:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1453. [2022-04-08 08:44:50,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:44:50,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1664 states. Second operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,687 INFO L74 IsIncluded]: Start isIncluded. First operand 1664 states. Second operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,688 INFO L87 Difference]: Start difference. First operand 1664 states. Second operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:50,776 INFO L93 Difference]: Finished difference Result 1664 states and 2382 transitions. [2022-04-08 08:44:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2382 transitions. [2022-04-08 08:44:50,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:50,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:50,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 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 1664 states. [2022-04-08 08:44:50,781 INFO L87 Difference]: Start difference. First operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 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 1664 states. [2022-04-08 08:44:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:44:50,884 INFO L93 Difference]: Finished difference Result 1664 states and 2382 transitions. [2022-04-08 08:44:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2382 transitions. [2022-04-08 08:44:50,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:44:50,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:44:50,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:44:50,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:44:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1448 states have (on average 1.4696132596685083) internal successors, (2128), 1448 states have internal predecessors, (2128), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2132 transitions. [2022-04-08 08:44:51,009 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2132 transitions. Word has length 207 [2022-04-08 08:44:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:44:51,010 INFO L478 AbstractCegarLoop]: Abstraction has 1453 states and 2132 transitions. [2022-04-08 08:44:51,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:44:51,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1453 states and 2132 transitions. [2022-04-08 08:44:53,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2132 edges. 2132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:44:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2132 transitions. [2022-04-08 08:44:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-04-08 08:44:53,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:44:53,737 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:44:53,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-08 08:44:53,737 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:44:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:44:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1085024224, now seen corresponding path program 1 times [2022-04-08 08:44:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:44:53,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [224446881] [2022-04-08 08:45:12,176 WARN L232 SmtUtils]: Spent 18.06s on a formula simplification that was a NOOP. DAG size: 240 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)