/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 15:11:06,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 15:11:06,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 15:11:06,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 15:11:06,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 15:11:06,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 15:11:06,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 15:11:06,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 15:11:06,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 15:11:06,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 15:11:06,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 15:11:06,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 15:11:06,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 15:11:06,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 15:11:06,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 15:11:06,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 15:11:06,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 15:11:06,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 15:11:06,728 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 15:11:06,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 15:11:06,734 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 15:11:06,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 15:11:06,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 15:11:06,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 15:11:06,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 15:11:06,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 15:11:06,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 15:11:06,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 15:11:06,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 15:11:06,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 15:11:06,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 15:11:06,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 15:11:06,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 15:11:06,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 15:11:06,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 15:11:06,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 15:11:06,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 15:11:06,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 15:11:06,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 15:11:06,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 15:11:06,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 15:11:06,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 15:11:06,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 15:11:06,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 15:11:06,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 15:11:06,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 15:11:06,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 15:11:06,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 15:11:06,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 15:11:06,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 15:11:06,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 15:11:06,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 15:11:06,763 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 15:11:06,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:11:06,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 15:11:06,764 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 15:11:06,765 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 15:11:06,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 15:11:06,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 15:11:06,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 15:11:06,976 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 15:11:06,977 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 15:11:06,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c [2022-04-08 15:11:07,024 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e4fdf2d/4bd8a36d51774d4cb1173f7ccb8c1650/FLAG0d8354e4a [2022-04-08 15:11:07,433 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 15:11:07,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.02.i.cil-1.c [2022-04-08 15:11:07,449 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e4fdf2d/4bd8a36d51774d4cb1173f7ccb8c1650/FLAG0d8354e4a [2022-04-08 15:11:07,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64e4fdf2d/4bd8a36d51774d4cb1173f7ccb8c1650 [2022-04-08 15:11:07,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 15:11:07,778 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 15:11:07,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 15:11:07,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 15:11:07,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 15:11:07,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:11:07" (1/1) ... [2022-04-08 15:11:07,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693acbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:07, skipping insertion in model container [2022-04-08 15:11:07,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:11:07" (1/1) ... [2022-04-08 15:11:07,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 15:11:07,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 15:11:08,125 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.02.i.cil-1.c[65397,65410] [2022-04-08 15:11:08,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:11:08,162 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 15:11:08,252 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.02.i.cil-1.c[65397,65410] [2022-04-08 15:11:08,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 15:11:08,266 INFO L208 MainTranslator]: Completed translation [2022-04-08 15:11:08,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08 WrapperNode [2022-04-08 15:11:08,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 15:11:08,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 15:11:08,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 15:11:08,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 15:11:08,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08" (1/1) ... [2022-04-08 15:11:08,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08" (1/1) ... [2022-04-08 15:11:08,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08" (1/1) ... [2022-04-08 15:11:08,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08" (1/1) ... [2022-04-08 15:11:08,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08" (1/1) ... [2022-04-08 15:11:08,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08" (1/1) ... [2022-04-08 15:11:08,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08" (1/1) ... [2022-04-08 15:11:08,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 15:11:08,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 15:11:08,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 15:11:08,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 15:11:08,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08" (1/1) ... [2022-04-08 15:11:08,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 15:11:08,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 15:11:08,416 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 15:11:08,429 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 15:11:08,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 15:11:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 15:11:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 15:11:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-04-08 15:11:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-04-08 15:11:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 15:11:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-04-08 15:11:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-04-08 15:11:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-08 15:11:08,454 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-04-08 15:11:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 15:11:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-04-08 15:11:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 15:11:08,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-08 15:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-04-08 15:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-04-08 15:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-04-08 15:11:08,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 15:11:08,610 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 15:11:08,611 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 15:11:10,048 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-08 15:11:10,472 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-04-08 15:11:10,472 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-04-08 15:11:10,487 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 15:11:10,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 15:11:10,497 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 15:11:10,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:11:10 BoogieIcfgContainer [2022-04-08 15:11:10,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 15:11:10,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 15:11:10,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 15:11:10,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 15:11:10,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:11:07" (1/3) ... [2022-04-08 15:11:10,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b72fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:11:10, skipping insertion in model container [2022-04-08 15:11:10,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:11:08" (2/3) ... [2022-04-08 15:11:10,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b72fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:11:10, skipping insertion in model container [2022-04-08 15:11:10,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:11:10" (3/3) ... [2022-04-08 15:11:10,506 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.02.i.cil-1.c [2022-04-08 15:11:10,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 15:11:10,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 15:11:10,541 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 15:11:10,550 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 15:11:10,550 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 15:11:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 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 15:11:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 15:11:10,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:10,579 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 15:11:10,579 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:10,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 1 times [2022-04-08 15:11:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:10,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464865675] [2022-04-08 15:11:10,594 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 15:11:10,595 INFO L85 PathProgramCache]: Analyzing trace with hash -22644822, now seen corresponding path program 2 times [2022-04-08 15:11:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:10,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819563819] [2022-04-08 15:11:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:11,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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(196, 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); {141#true} is VALID [2022-04-08 15:11:11,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 15:11:11,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 15:11:11,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {148#(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 15:11:11,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(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(196, 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); {141#true} is VALID [2022-04-08 15:11:11,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#true} assume true; {141#true} is VALID [2022-04-08 15:11:11,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {141#true} {141#true} #593#return; {141#true} is VALID [2022-04-08 15:11:11,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {141#true} call #t~ret158 := main(); {141#true} is VALID [2022-04-08 15:11:11,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {141#true} is VALID [2022-04-08 15:11:11,122 INFO L272 TraceCheckUtils]: 6: Hoare triple {141#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {141#true} is VALID [2022-04-08 15:11:11,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:11,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:11,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:11,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 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)))); {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:11,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} assume !false; {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} is VALID [2022-04-08 15:11:11,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#(= 12292 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {147#(= 12292 |ssl3_connect_#t~mem49|)} is VALID [2022-04-08 15:11:11,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {147#(= 12292 |ssl3_connect_#t~mem49|)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {142#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {142#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {142#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {142#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {142#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {142#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {142#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {142#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {142#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {142#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {142#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {142#false} is VALID [2022-04-08 15:11:11,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {142#false} assume 4432 == #t~mem62;havoc #t~mem62; {142#false} is VALID [2022-04-08 15:11:11,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {142#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {142#false} is VALID [2022-04-08 15:11:11,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {142#false} assume 4 == ~blastFlag~0; {142#false} is VALID [2022-04-08 15:11:11,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {142#false} assume !false; {142#false} is VALID [2022-04-08 15:11:11,133 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 15:11:11,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:11,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819563819] [2022-04-08 15:11:11,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819563819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:11,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:11,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:11,136 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:11,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464865675] [2022-04-08 15:11:11,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464865675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:11,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:11,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321308217] [2022-04-08 15:11:11,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:11,142 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 15:11:11,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:11,147 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 15:11:11,177 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 15:11:11,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:11:11,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:11,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:11:11,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:11:11,201 INFO L87 Difference]: Start difference. First operand has 138 states, 130 states have (on average 1.6923076923076923) internal successors, (220), 131 states have internal predecessors, (220), 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 15:11:13,258 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 15:11:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:14,363 INFO L93 Difference]: Finished difference Result 267 states and 442 transitions. [2022-04-08 15:11:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:11:14,365 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 15:11:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:14,370 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 15:11:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 15:11:14,391 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 15:11:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2022-04-08 15:11:14,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 442 transitions. [2022-04-08 15:11:14,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:14,742 INFO L225 Difference]: With dead ends: 267 [2022-04-08 15:11:14,742 INFO L226 Difference]: Without dead ends: 122 [2022-04-08 15:11:14,744 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 15:11:14,746 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 7 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:14,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 555 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:11:14,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-08 15:11:14,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-08 15:11:14,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:14,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:14,773 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:14,773 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:14,778 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 15:11:14,778 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 15:11:14,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:14,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:14,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 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 122 states. [2022-04-08 15:11:14,783 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 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 122 states. [2022-04-08 15:11:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:14,790 INFO L93 Difference]: Finished difference Result 122 states and 179 transitions. [2022-04-08 15:11:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2022-04-08 15:11:14,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:14,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:14,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:14,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.5) internal successors, (174), 116 states have internal predecessors, (174), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2022-04-08 15:11:14,801 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 30 [2022-04-08 15:11:14,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:14,802 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2022-04-08 15:11:14,802 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 15:11:14,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 178 transitions. [2022-04-08 15:11:14,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2022-04-08 15:11:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-08 15:11:14,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:14,922 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] [2022-04-08 15:11:14,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 15:11:14,922 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:14,923 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 1 times [2022-04-08 15:11:14,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:14,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [736987027] [2022-04-08 15:11:14,924 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash 868047042, now seen corresponding path program 2 times [2022-04-08 15:11:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:14,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118537065] [2022-04-08 15:11:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:15,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {1179#(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(196, 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); {1173#true} is VALID [2022-04-08 15:11:15,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 15:11:15,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 15:11:15,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} call ULTIMATE.init(); {1179#(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 15:11:15,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1179#(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(196, 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); {1173#true} is VALID [2022-04-08 15:11:15,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} assume true; {1173#true} is VALID [2022-04-08 15:11:15,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} #593#return; {1173#true} is VALID [2022-04-08 15:11:15,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} call #t~ret158 := main(); {1173#true} is VALID [2022-04-08 15:11:15,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {1173#true} is VALID [2022-04-08 15:11:15,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {1173#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {1173#true} is VALID [2022-04-08 15:11:15,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {1178#(= 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)))); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 12292 == #t~mem49;havoc #t~mem49; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call write~int(0, ~s.base, 56 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___4~0); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,152 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} ~skip~0 := 0; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !false; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,154 INFO L290 TraceCheckUtils]: 31: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,155 INFO L290 TraceCheckUtils]: 34: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,155 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4432 == #t~mem62;havoc #t~mem62; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {1178#(= ssl3_connect_~blastFlag~0 0)} is VALID [2022-04-08 15:11:15,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {1178#(= ssl3_connect_~blastFlag~0 0)} assume 4 == ~blastFlag~0; {1174#false} is VALID [2022-04-08 15:11:15,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {1174#false} assume !false; {1174#false} is VALID [2022-04-08 15:11:15,158 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 15:11:15,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:15,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118537065] [2022-04-08 15:11:15,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118537065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:15,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:15,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:15,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:15,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [736987027] [2022-04-08 15:11:15,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [736987027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:15,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:15,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517821092] [2022-04-08 15:11:15,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:15,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 15:11:15,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:15,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:15,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:15,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:11:15,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:15,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:11:15,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:15,197 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:17,216 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 15:11:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:17,814 INFO L93 Difference]: Finished difference Result 326 states and 488 transitions. [2022-04-08 15:11:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:11:17,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-08 15:11:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:17,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-08 15:11:17,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2022-04-08 15:11:17,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 485 transitions. [2022-04-08 15:11:18,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 485 edges. 485 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:18,176 INFO L225 Difference]: With dead ends: 326 [2022-04-08 15:11:18,176 INFO L226 Difference]: Without dead ends: 221 [2022-04-08 15:11:18,177 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 15:11:18,177 INFO L913 BasicCegarLoop]: 167 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:18,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 320 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-08 15:11:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-08 15:11:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-08 15:11:18,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:18,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:18,191 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:18,191 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:18,198 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-08 15:11:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-08 15:11:18,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:18,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:18,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 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 221 states. [2022-04-08 15:11:18,199 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 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 221 states. [2022-04-08 15:11:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:18,206 INFO L93 Difference]: Finished difference Result 221 states and 325 transitions. [2022-04-08 15:11:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-08 15:11:18,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:18,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:18,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:18,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:18,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.4861111111111112) internal successors, (321), 216 states have internal predecessors, (321), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2022-04-08 15:11:18,212 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 44 [2022-04-08 15:11:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:18,213 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2022-04-08 15:11:18,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:18,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 325 transitions. [2022-04-08 15:11:18,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:18,435 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2022-04-08 15:11:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 15:11:18,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:18,436 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] [2022-04-08 15:11:18,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 15:11:18,436 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:18,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:18,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 1 times [2022-04-08 15:11:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:18,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74300331] [2022-04-08 15:11:18,437 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:18,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1147706284, now seen corresponding path program 2 times [2022-04-08 15:11:18,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:18,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313774137] [2022-04-08 15:11:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:18,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:18,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:18,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {2725#(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(196, 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); {2718#true} is VALID [2022-04-08 15:11:18,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-08 15:11:18,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-08 15:11:18,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {2718#true} call ULTIMATE.init(); {2725#(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 15:11:18,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {2725#(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(196, 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); {2718#true} is VALID [2022-04-08 15:11:18,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {2718#true} assume true; {2718#true} is VALID [2022-04-08 15:11:18,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2718#true} {2718#true} #593#return; {2718#true} is VALID [2022-04-08 15:11:18,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {2718#true} call #t~ret158 := main(); {2718#true} is VALID [2022-04-08 15:11:18,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {2718#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {2718#true} is VALID [2022-04-08 15:11:18,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {2718#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {2718#true} is VALID [2022-04-08 15:11:18,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {2718#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {2718#true} is VALID [2022-04-08 15:11:18,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {2718#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {2718#true} is VALID [2022-04-08 15:11:18,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {2718#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {2718#true} is VALID [2022-04-08 15:11:18,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {2718#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {2718#true} is VALID [2022-04-08 15:11:18,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-08 15:11:18,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {2718#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {2718#true} assume 12292 == #t~mem49;havoc #t~mem49; {2718#true} is VALID [2022-04-08 15:11:18,626 INFO L290 TraceCheckUtils]: 14: Hoare triple {2718#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {2718#true} is VALID [2022-04-08 15:11:18,626 INFO L290 TraceCheckUtils]: 15: Hoare triple {2718#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {2718#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {2718#true} is VALID [2022-04-08 15:11:18,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {2718#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {2718#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {2718#true} is VALID [2022-04-08 15:11:18,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {2718#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {2718#true} is VALID [2022-04-08 15:11:18,627 INFO L290 TraceCheckUtils]: 20: Hoare triple {2718#true} assume !(0 == ~tmp___4~0); {2718#true} is VALID [2022-04-08 15:11:18,627 INFO L290 TraceCheckUtils]: 21: Hoare triple {2718#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {2718#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {2718#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2718#true} is VALID [2022-04-08 15:11:18,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {2718#true} ~skip~0 := 0; {2718#true} is VALID [2022-04-08 15:11:18,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {2718#true} assume !false; {2718#true} is VALID [2022-04-08 15:11:18,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {2718#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {2718#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {2718#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {2718#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {2718#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {2718#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2718#true} is VALID [2022-04-08 15:11:18,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {2718#true} assume 4368 == #t~mem54;havoc #t~mem54; {2718#true} is VALID [2022-04-08 15:11:18,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {2718#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {2718#true} is VALID [2022-04-08 15:11:18,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {2718#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2718#true} is VALID [2022-04-08 15:11:18,630 INFO L290 TraceCheckUtils]: 35: Hoare triple {2718#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,631 INFO L290 TraceCheckUtils]: 37: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,631 INFO L290 TraceCheckUtils]: 38: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,632 INFO L290 TraceCheckUtils]: 39: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} ~skip~0 := 0; {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !false; {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,633 INFO L290 TraceCheckUtils]: 41: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,633 INFO L290 TraceCheckUtils]: 42: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,633 INFO L290 TraceCheckUtils]: 43: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,635 INFO L290 TraceCheckUtils]: 46: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,635 INFO L290 TraceCheckUtils]: 47: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,635 INFO L290 TraceCheckUtils]: 48: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,636 INFO L290 TraceCheckUtils]: 51: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} is VALID [2022-04-08 15:11:18,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {2723#(not (= 4432 (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset))))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {2724#(not (= |ssl3_connect_#t~mem62| 4432))} is VALID [2022-04-08 15:11:18,638 INFO L290 TraceCheckUtils]: 55: Hoare triple {2724#(not (= |ssl3_connect_#t~mem62| 4432))} assume 4432 == #t~mem62;havoc #t~mem62; {2719#false} is VALID [2022-04-08 15:11:18,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {2719#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {2719#false} is VALID [2022-04-08 15:11:18,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {2719#false} assume 4 == ~blastFlag~0; {2719#false} is VALID [2022-04-08 15:11:18,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {2719#false} assume !false; {2719#false} is VALID [2022-04-08 15:11:18,639 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 15:11:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:18,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313774137] [2022-04-08 15:11:18,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313774137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:18,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:18,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:18,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:18,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74300331] [2022-04-08 15:11:18,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74300331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:18,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:18,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:18,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952705465] [2022-04-08 15:11:18,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-08 15:11:18,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:18,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:18,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:18,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:11:18,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:18,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:11:18,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:11:18,691 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:20,715 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 15:11:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:21,753 INFO L93 Difference]: Finished difference Result 608 states and 905 transitions. [2022-04-08 15:11:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:11:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-08 15:11:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:21,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:11:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:11:21,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 15:11:22,073 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 15:11:22,088 INFO L225 Difference]: With dead ends: 608 [2022-04-08 15:11:22,088 INFO L226 Difference]: Without dead ends: 403 [2022-04-08 15:11:22,089 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 15:11:22,090 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:22,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 279 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:11:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-08 15:11:22,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 269. [2022-04-08 15:11:22,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:22,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:22,115 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:22,115 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:22,129 INFO L93 Difference]: Finished difference Result 403 states and 598 transitions. [2022-04-08 15:11:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 598 transitions. [2022-04-08 15:11:22,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:22,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:22,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 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 403 states. [2022-04-08 15:11:22,131 INFO L87 Difference]: Start difference. First operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 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 403 states. [2022-04-08 15:11:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:22,144 INFO L93 Difference]: Finished difference Result 403 states and 598 transitions. [2022-04-08 15:11:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 598 transitions. [2022-04-08 15:11:22,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:22,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:22,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:22,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 264 states have (on average 1.5340909090909092) internal successors, (405), 264 states have internal predecessors, (405), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 409 transitions. [2022-04-08 15:11:22,155 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 409 transitions. Word has length 59 [2022-04-08 15:11:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:22,155 INFO L478 AbstractCegarLoop]: Abstraction has 269 states and 409 transitions. [2022-04-08 15:11:22,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:22,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 269 states and 409 transitions. [2022-04-08 15:11:22,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 409 edges. 409 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:22,464 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 409 transitions. [2022-04-08 15:11:22,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-08 15:11:22,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:22,465 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 15:11:22,465 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 15:11:22,466 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:22,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1214470671, now seen corresponding path program 1 times [2022-04-08 15:11:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:22,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091263943] [2022-04-08 15:11:22,466 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:22,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1214470671, now seen corresponding path program 2 times [2022-04-08 15:11:22,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:22,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086606772] [2022-04-08 15:11:22,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:22,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:22,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {5297#(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(196, 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); {5290#true} is VALID [2022-04-08 15:11:22,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {5290#true} assume true; {5290#true} is VALID [2022-04-08 15:11:22,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5290#true} {5290#true} #593#return; {5290#true} is VALID [2022-04-08 15:11:22,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {5290#true} call ULTIMATE.init(); {5297#(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 15:11:22,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {5297#(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(196, 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); {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {5290#true} assume true; {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5290#true} {5290#true} #593#return; {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L272 TraceCheckUtils]: 4: Hoare triple {5290#true} call #t~ret158 := main(); {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {5290#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L272 TraceCheckUtils]: 6: Hoare triple {5290#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {5290#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {5290#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {5290#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {5290#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {5290#true} is VALID [2022-04-08 15:11:22,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {5290#true} assume !false; {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {5290#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {5290#true} assume 12292 == #t~mem49;havoc #t~mem49; {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {5290#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {5290#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {5290#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {5290#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {5290#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {5290#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {5290#true} assume !(0 == ~tmp___4~0); {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {5290#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {5290#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {5290#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {5290#true} ~skip~0 := 0; {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {5290#true} assume !false; {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {5290#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {5290#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {5290#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 29: Hoare triple {5290#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {5290#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {5290#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {5290#true} assume 4368 == #t~mem54;havoc #t~mem54; {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {5290#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {5290#true} is VALID [2022-04-08 15:11:22,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {5290#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5290#true} is VALID [2022-04-08 15:11:22,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {5290#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} ~skip~0 := 0; {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !false; {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,654 INFO L290 TraceCheckUtils]: 44: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,655 INFO L290 TraceCheckUtils]: 50: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} is VALID [2022-04-08 15:11:22,657 INFO L290 TraceCheckUtils]: 55: Hoare triple {5295#(not (= (select (select |#memory_int| ssl3_connect_~s.base) (+ 72 ssl3_connect_~s.offset)) 4433))} assume !(4432 == #t~mem62);havoc #t~mem62;call #t~mem63 := read~int(~s.base, 72 + ~s.offset, 4); {5296#(not (= |ssl3_connect_#t~mem63| 4433))} is VALID [2022-04-08 15:11:22,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {5296#(not (= |ssl3_connect_#t~mem63| 4433))} assume 4433 == #t~mem63;havoc #t~mem63; {5291#false} is VALID [2022-04-08 15:11:22,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {5291#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {5291#false} is VALID [2022-04-08 15:11:22,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {5291#false} assume 4 == ~blastFlag~0; {5291#false} is VALID [2022-04-08 15:11:22,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {5291#false} assume !false; {5291#false} is VALID [2022-04-08 15:11:22,660 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 15:11:22,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:22,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086606772] [2022-04-08 15:11:22,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086606772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:22,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:22,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:22,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:22,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091263943] [2022-04-08 15:11:22,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091263943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:22,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:22,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 15:11:22,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277199337] [2022-04-08 15:11:22,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:22,662 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 15:11:22,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:22,663 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 15:11:22,703 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 15:11:22,703 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 15:11:22,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:22,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 15:11:22,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 15:11:22,704 INFO L87 Difference]: Start difference. First operand 269 states and 409 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 15:11:24,723 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 15:11:25,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:25,720 INFO L93 Difference]: Finished difference Result 704 states and 1073 transitions. [2022-04-08 15:11:25,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 15:11:25,720 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 15:11:25,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:25,720 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 15:11:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:11:25,724 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 15:11:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 475 transitions. [2022-04-08 15:11:25,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 475 transitions. [2022-04-08 15:11:26,062 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 15:11:26,072 INFO L225 Difference]: With dead ends: 704 [2022-04-08 15:11:26,072 INFO L226 Difference]: Without dead ends: 451 [2022-04-08 15:11:26,073 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 15:11:26,074 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 106 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:26,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 278 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-08 15:11:26,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-04-08 15:11:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 319. [2022-04-08 15:11:26,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:26,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 451 states. Second operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:26,125 INFO L74 IsIncluded]: Start isIncluded. First operand 451 states. Second operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:26,125 INFO L87 Difference]: Start difference. First operand 451 states. Second operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:26,141 INFO L93 Difference]: Finished difference Result 451 states and 682 transitions. [2022-04-08 15:11:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 682 transitions. [2022-04-08 15:11:26,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:26,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:26,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 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 451 states. [2022-04-08 15:11:26,143 INFO L87 Difference]: Start difference. First operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 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 451 states. [2022-04-08 15:11:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:26,157 INFO L93 Difference]: Finished difference Result 451 states and 682 transitions. [2022-04-08 15:11:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 682 transitions. [2022-04-08 15:11:26,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:26,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:26,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:26,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 314 states have (on average 1.570063694267516) internal successors, (493), 314 states have internal predecessors, (493), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 497 transitions. [2022-04-08 15:11:26,165 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 497 transitions. Word has length 60 [2022-04-08 15:11:26,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:26,166 INFO L478 AbstractCegarLoop]: Abstraction has 319 states and 497 transitions. [2022-04-08 15:11:26,166 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 15:11:26,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 319 states and 497 transitions. [2022-04-08 15:11:26,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 497 edges. 497 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 497 transitions. [2022-04-08 15:11:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 15:11:26,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:26,512 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:26,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 15:11:26,512 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2050349165, now seen corresponding path program 1 times [2022-04-08 15:11:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:26,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [602732183] [2022-04-08 15:11:26,513 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2050349165, now seen corresponding path program 2 times [2022-04-08 15:11:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:26,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747215318] [2022-04-08 15:11:26,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:26,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:26,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {8256#(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(196, 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); {8250#true} is VALID [2022-04-08 15:11:26,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {8250#true} assume true; {8250#true} is VALID [2022-04-08 15:11:26,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8250#true} {8250#true} #593#return; {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {8250#true} call ULTIMATE.init(); {8256#(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 15:11:26,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {8256#(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(196, 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); {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {8250#true} assume true; {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8250#true} {8250#true} #593#return; {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {8250#true} call #t~ret158 := main(); {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {8250#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {8250#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {8250#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {8250#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {8250#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {8250#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {8250#true} assume !false; {8250#true} is VALID [2022-04-08 15:11:26,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {8250#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {8250#true} assume 12292 == #t~mem49;havoc #t~mem49; {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {8250#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {8250#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {8250#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {8250#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {8250#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {8250#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {8250#true} assume !(0 == ~tmp___4~0); {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {8250#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {8250#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {8250#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {8250#true} ~skip~0 := 0; {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {8250#true} assume !false; {8250#true} is VALID [2022-04-08 15:11:26,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {8250#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {8250#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {8250#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {8250#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {8250#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {8250#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8250#true} is VALID [2022-04-08 15:11:26,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {8250#true} assume 4368 == #t~mem54;havoc #t~mem54; {8250#true} is VALID [2022-04-08 15:11:26,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {8250#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {8250#true} is VALID [2022-04-08 15:11:26,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {8250#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,680 INFO L290 TraceCheckUtils]: 38: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} ~skip~0 := 0; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,681 INFO L290 TraceCheckUtils]: 40: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !false; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,683 INFO L290 TraceCheckUtils]: 41: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,692 INFO L290 TraceCheckUtils]: 52: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume 4416 == #t~mem60;havoc #t~mem60; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {8255#(= ssl3_connect_~blastFlag~0 1)} is VALID [2022-04-08 15:11:26,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {8255#(= ssl3_connect_~blastFlag~0 1)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {8251#false} is VALID [2022-04-08 15:11:26,692 INFO L290 TraceCheckUtils]: 56: Hoare triple {8251#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {8251#false} assume !(0 == ~tmp___6~0); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {8251#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {8251#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 60: Hoare triple {8251#false} ~skip~0 := 0; {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 61: Hoare triple {8251#false} assume !false; {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 62: Hoare triple {8251#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 63: Hoare triple {8251#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {8251#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {8251#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 66: Hoare triple {8251#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 67: Hoare triple {8251#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 68: Hoare triple {8251#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 69: Hoare triple {8251#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 70: Hoare triple {8251#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 71: Hoare triple {8251#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,693 INFO L290 TraceCheckUtils]: 72: Hoare triple {8251#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {8251#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,694 INFO L290 TraceCheckUtils]: 74: Hoare triple {8251#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,694 INFO L290 TraceCheckUtils]: 75: Hoare triple {8251#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {8251#false} is VALID [2022-04-08 15:11:26,694 INFO L290 TraceCheckUtils]: 76: Hoare triple {8251#false} assume 4432 == #t~mem62;havoc #t~mem62; {8251#false} is VALID [2022-04-08 15:11:26,694 INFO L290 TraceCheckUtils]: 77: Hoare triple {8251#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {8251#false} is VALID [2022-04-08 15:11:26,694 INFO L290 TraceCheckUtils]: 78: Hoare triple {8251#false} assume 4 == ~blastFlag~0; {8251#false} is VALID [2022-04-08 15:11:26,694 INFO L290 TraceCheckUtils]: 79: Hoare triple {8251#false} assume !false; {8251#false} is VALID [2022-04-08 15:11:26,694 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 15:11:26,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:26,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747215318] [2022-04-08 15:11:26,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747215318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:26,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:26,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:26,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:26,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [602732183] [2022-04-08 15:11:26,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [602732183] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:26,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:26,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166338297] [2022-04-08 15:11:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:26,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 15:11:26,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:26,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:26,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:26,745 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:11:26,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:26,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:11:26,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:26,746 INFO L87 Difference]: Start difference. First operand 319 states and 497 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:28,763 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 15:11:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:29,636 INFO L93 Difference]: Finished difference Result 622 states and 980 transitions. [2022-04-08 15:11:29,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:11:29,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 80 [2022-04-08 15:11:29,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-08 15:11:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2022-04-08 15:11:29,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 486 transitions. [2022-04-08 15:11:29,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 486 edges. 486 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:29,976 INFO L225 Difference]: With dead ends: 622 [2022-04-08 15:11:29,977 INFO L226 Difference]: Without dead ends: 468 [2022-04-08 15:11:29,977 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 15:11:29,978 INFO L913 BasicCegarLoop]: 307 mSDtfsCounter, 126 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:29,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 469 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 331 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:11:29,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-04-08 15:11:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2022-04-08 15:11:29,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:29,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:29,992 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:29,993 INFO L87 Difference]: Start difference. First operand 468 states. Second operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:30,003 INFO L93 Difference]: Finished difference Result 468 states and 730 transitions. [2022-04-08 15:11:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 730 transitions. [2022-04-08 15:11:30,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:30,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:30,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 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 468 states. [2022-04-08 15:11:30,005 INFO L87 Difference]: Start difference. First operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 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 468 states. [2022-04-08 15:11:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:30,015 INFO L93 Difference]: Finished difference Result 468 states and 730 transitions. [2022-04-08 15:11:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 730 transitions. [2022-04-08 15:11:30,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:30,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:30,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:30,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 463 states have (on average 1.568034557235421) internal successors, (726), 463 states have internal predecessors, (726), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 730 transitions. [2022-04-08 15:11:30,028 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 730 transitions. Word has length 80 [2022-04-08 15:11:30,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:30,029 INFO L478 AbstractCegarLoop]: Abstraction has 468 states and 730 transitions. [2022-04-08 15:11:30,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 3 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:30,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 468 states and 730 transitions. [2022-04-08 15:11:30,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 730 edges. 730 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 730 transitions. [2022-04-08 15:11:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-08 15:11:30,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:30,573 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 15:11:30,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 15:11:30,573 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:30,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:30,573 INFO L85 PathProgramCache]: Analyzing trace with hash 684039926, now seen corresponding path program 1 times [2022-04-08 15:11:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:30,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1308770732] [2022-04-08 15:11:30,574 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 684039926, now seen corresponding path program 2 times [2022-04-08 15:11:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:30,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333392504] [2022-04-08 15:11:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:30,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 15:11:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 15:11:30,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {11381#(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(196, 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); {11375#true} is VALID [2022-04-08 15:11:30,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {11375#true} assume true; {11375#true} is VALID [2022-04-08 15:11:30,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11375#true} {11375#true} #593#return; {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {11375#true} call ULTIMATE.init(); {11381#(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 15:11:30,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {11381#(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(196, 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); {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {11375#true} assume true; {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11375#true} {11375#true} #593#return; {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {11375#true} call #t~ret158 := main(); {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {11375#true} call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(356);~s~0.base, ~s~0.offset := #t~malloc7.base, #t~malloc7.offset;havoc #t~malloc7.base, #t~malloc7.offset;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(979);call write~$Pointer$(#t~malloc8.base, #t~malloc8.offset, ~s~0.base, 116 + ~s~0.offset, 8);havoc #t~malloc8.base, #t~malloc8.offset;call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(348);call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~s~0.base, 288 + ~s~0.offset, 8);havoc #t~malloc9.base, #t~malloc9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.allocOnHeap(244);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~s~0.base, 248 + ~s~0.offset, 8);havoc #t~malloc10.base, #t~malloc10.offset;call write~int(12292, ~s~0.base, 72 + ~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 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet12 % 18446744073709551616 % 18446744073709551616 else #t~nondet12 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 272 + ~s~0.offset, 8);havoc #t~nondet12;call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~s~0.base, 288 + ~s~0.offset, 8);call write~$Pointer$(0, (if #t~nondet14 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet14 % 18446744073709551616 % 18446744073709551616 else #t~nondet14 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), #t~mem13.base, 164 + #t~mem13.offset, 8);havoc #t~mem13.base, #t~mem13.offset;havoc #t~nondet14;call write~$Pointer$(0, (if #t~nondet15 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet15 % 18446744073709551616 % 18446744073709551616 else #t~nondet15 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 80 + ~s~0.offset, 8);havoc #t~nondet15;call write~$Pointer$(0, (if #t~nondet16 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet16 % 18446744073709551616 % 18446744073709551616 else #t~nondet16 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 32 + ~s~0.offset, 8);havoc #t~nondet16;call write~$Pointer$(0, (if #t~nondet17 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~nondet17 % 18446744073709551616 % 18446744073709551616 else #t~nondet17 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616), ~s~0.base, 24 + ~s~0.offset, 8);havoc #t~nondet17;call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -9223372036854775808 <= #t~nondet19 && #t~nondet19 <= 9223372036854775807;call write~int(#t~nondet19, #t~mem18.base, #t~mem18.offset, 8);havoc #t~mem18.base, #t~mem18.offset;havoc #t~nondet19;call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~s~0.base, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet21 && #t~nondet21 <= 2147483647;call write~int(#t~nondet21, #t~mem20.base, 912 + #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, 116 + ~s~0.offset, 8);call #t~malloc23.base, #t~malloc23.offset := #Ultimate.allocOnHeap(68);call write~$Pointer$(#t~malloc23.base, #t~malloc23.offset, #t~mem22.base, 888 + #t~mem22.offset, 8);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, 116 + ~s~0.offset, 8);call #t~mem25.base, #t~mem25.offset := read~$Pointer$(#t~mem24.base, 888 + #t~mem24.offset, 8);call write~int(#t~nondet26, #t~mem25.base, 20 + #t~mem25.offset, 8);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, 116 + ~s~0.offset, 8);assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;call write~int(#t~nondet28, #t~mem27.base, 904 + #t~mem27.offset, 4);havoc #t~mem27.base, #t~mem27.offset;havoc #t~nondet28; {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L272 TraceCheckUtils]: 6: Hoare triple {11375#true} call #t~ret29 := ssl3_connect(~s~0.base, ~s~0.offset); {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {11375#true} ~s.base, ~s.offset := #in~s.base, #in~s.offset;havoc ~buf~0.base, ~buf~0.offset;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~nondet30 && #t~nondet30 <= 2147483647;~tmp___1~0 := #t~nondet30;havoc #t~nondet30;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp___2~0 := #t~nondet31;havoc #t~nondet31;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~tmp___3~0 := #t~nondet32;havoc #t~nondet32;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp___4~0 := #t~nondet33;havoc #t~nondet33;assume -2147483648 <= #t~nondet34 && #t~nondet34 <= 2147483647;~tmp___5~0 := #t~nondet34;havoc #t~nondet34;assume -2147483648 <= #t~nondet35 && #t~nondet35 <= 2147483647;~tmp___6~0 := #t~nondet35;havoc #t~nondet35;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~tmp___7~0 := #t~nondet36;havoc #t~nondet36;assume -2147483648 <= #t~nondet37 && #t~nondet37 <= 2147483647;~tmp___8~0 := #t~nondet37;havoc #t~nondet37;assume -9223372036854775808 <= #t~nondet38 && #t~nondet38 <= 9223372036854775807;~tmp___9~0 := #t~nondet38;havoc #t~nondet38;havoc ~blastFlag~0;~blastFlag~0 := 0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;call write~int(#t~nondet39, ~s.base, 128 + ~s.offset, 4);havoc #t~nondet39;call write~int(12292, ~s.base, 72 + ~s.offset, 4);assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~tmp~2 := #t~nondet40;havoc #t~nondet40;~cb~0.base, ~cb~0.offset := 0, 0;~ret~0 := -1;~skip~0 := 0;call #t~mem41.base, #t~mem41.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8); {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {11375#true} assume 0 != (#t~mem41.base + #t~mem41.offset) % 18446744073709551616;havoc #t~mem41.base, #t~mem41.offset;call #t~mem42.base, #t~mem42.offset := read~$Pointer$(~s.base, 272 + ~s.offset, 8);~cb~0.base, ~cb~0.offset := #t~mem42.base, #t~mem42.offset;havoc #t~mem42.base, #t~mem42.offset; {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {11375#true} call #t~mem47 := read~int(~s.base, 44 + ~s.offset, 4);call write~int(1 + #t~mem47, ~s.base, 44 + ~s.offset, 4);havoc #t~mem47; {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {11375#true} assume !(0 != (if 0 == ~tmp___1~0 then 0 else (if 1 == ~tmp___1~0 then 0 else ~bitwiseAnd(~tmp___1~0, 12288)))); {11375#true} is VALID [2022-04-08 15:11:30,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {11375#true} assume !false; {11375#true} is VALID [2022-04-08 15:11:30,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {11375#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {11375#true} assume 12292 == #t~mem49;havoc #t~mem49; {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {11375#true} call write~int(1, ~s.base, 60 + ~s.offset, 4);call write~int(4096, ~s.base, 72 + ~s.offset, 4);call #t~mem82.base, #t~mem82.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem83 := read~int(#t~mem82.base, 120 + #t~mem82.offset, 4);call write~int(1 + #t~mem83, #t~mem82.base, 120 + #t~mem82.offset, 4);havoc #t~mem82.base, #t~mem82.offset;havoc #t~mem83; {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {11375#true} call write~int(0, ~s.base, 56 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {11375#true} assume 0 != (~cb~0.base + ~cb~0.offset) % 18446744073709551616; {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {11375#true} call #t~mem84 := read~int(~s.base, ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {11375#true} assume !(768 != (if 0 == #t~mem84 then 0 else (if 1 == #t~mem84 then 0 else ~bitwiseAnd(#t~mem84, 65280))));havoc #t~mem84;call write~int(4096, ~s.base, 4 + ~s.offset, 4);call #t~mem85.base, #t~mem85.offset := read~$Pointer$(~s.base, 80 + ~s.offset, 8); {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {11375#true} assume !(0 == (#t~mem85.base + #t~mem85.offset) % 18446744073709551616);havoc #t~mem85.base, #t~mem85.offset; {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {11375#true} assume !(0 == ~tmp___4~0); {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {11375#true} assume !(0 == ~tmp___5~0);call write~int(4368, ~s.base, 72 + ~s.offset, 4);call #t~mem87.base, #t~mem87.offset := read~$Pointer$(~s.base, 288 + ~s.offset, 8);call #t~mem88 := read~int(#t~mem87.base, 116 + #t~mem87.offset, 4);call write~int(1 + #t~mem88, #t~mem87.base, 116 + #t~mem87.offset, 4);havoc #t~mem87.base, #t~mem87.offset;havoc #t~mem88;call write~int(0, ~s.base, 88 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {11375#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {11375#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {11375#true} ~skip~0 := 0; {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {11375#true} assume !false; {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {11375#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {11375#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {11375#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {11375#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {11375#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {11375#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {11375#true} assume 4368 == #t~mem54;havoc #t~mem54; {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#true} call write~int(0, ~s.base, 68 + ~s.offset, 4);assume -2147483648 <= #t~nondet89 && #t~nondet89 <= 2147483647;~ret~0 := #t~nondet89;havoc #t~nondet89; {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {11375#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {11375#true} assume !(~ret~0 <= 0);call write~int(4384, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4);call #t~mem90.base, #t~mem90.offset := read~$Pointer$(~s.base, 32 + ~s.offset, 8);call #t~mem91.base, #t~mem91.offset := read~$Pointer$(~s.base, 24 + ~s.offset, 8); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {11375#true} assume (#t~mem90.base + #t~mem90.offset) % 18446744073709551616 != (#t~mem91.base + #t~mem91.offset) % 18446744073709551616;havoc #t~mem90.base, #t~mem90.offset;havoc #t~mem91.base, #t~mem91.offset; {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 37: Hoare triple {11375#true} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {11375#true} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {11375#true} ~skip~0 := 0; {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {11375#true} assume !false; {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {11375#true} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {11375#true} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {11375#true} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {11375#true} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {11375#true} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {11375#true} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {11375#true} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {11375#true} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11375#true} is VALID [2022-04-08 15:11:30,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {11375#true} assume 4384 == #t~mem56;havoc #t~mem56; {11375#true} is VALID [2022-04-08 15:11:30,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {11375#true} assume -2147483648 <= #t~nondet92 && #t~nondet92 <= 2147483647;~ret~0 := #t~nondet92;havoc #t~nondet92; {11375#true} is VALID [2022-04-08 15:11:30,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {11375#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(~ret~0 <= 0);call #t~mem93 := read~int(~s.base, 128 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,768 INFO L290 TraceCheckUtils]: 53: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 != #t~mem93);havoc #t~mem93;call write~int(4400, ~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,768 INFO L290 TraceCheckUtils]: 54: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} call write~int(0, ~s.base, 88 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} ~skip~0 := 0; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !false; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,770 INFO L290 TraceCheckUtils]: 60: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,771 INFO L290 TraceCheckUtils]: 64: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,771 INFO L290 TraceCheckUtils]: 66: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,771 INFO L290 TraceCheckUtils]: 67: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,772 INFO L290 TraceCheckUtils]: 70: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume 4416 == #t~mem60;havoc #t~mem60; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 72: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume -2147483648 <= #t~nondet98 && #t~nondet98 <= 2147483647;~ret~0 := #t~nondet98;havoc #t~nondet98; {11380#(= 2 ssl3_connect_~blastFlag~0)} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {11380#(= 2 ssl3_connect_~blastFlag~0)} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {11376#false} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 74: Hoare triple {11376#false} assume !(~ret~0 <= 0);call write~int(4432, ~s.base, 72 + ~s.offset, 4);call write~int(0, ~s.base, 88 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 75: Hoare triple {11376#false} assume !(0 == ~tmp___6~0); {11376#false} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 76: Hoare triple {11376#false} call #t~mem147.base, #t~mem147.offset := read~$Pointer$(~s.base, 116 + ~s.offset, 8);call #t~mem148 := read~int(#t~mem147.base, 908 + #t~mem147.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 77: Hoare triple {11376#false} assume !(0 == #t~mem148);havoc #t~mem147.base, #t~mem147.offset;havoc #t~mem148; {11376#false} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 78: Hoare triple {11376#false} ~skip~0 := 0; {11376#false} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 79: Hoare triple {11376#false} assume !false; {11376#false} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 80: Hoare triple {11376#false} call #t~mem48 := read~int(~s.base, 72 + ~s.offset, 4);~state~0 := #t~mem48;havoc #t~mem48;call #t~mem49 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,773 INFO L290 TraceCheckUtils]: 81: Hoare triple {11376#false} assume !(12292 == #t~mem49);havoc #t~mem49;call #t~mem50 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,774 INFO L290 TraceCheckUtils]: 82: Hoare triple {11376#false} assume !(16384 == #t~mem50);havoc #t~mem50;call #t~mem51 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,774 INFO L290 TraceCheckUtils]: 83: Hoare triple {11376#false} assume !(4096 == #t~mem51);havoc #t~mem51;call #t~mem52 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,774 INFO L290 TraceCheckUtils]: 84: Hoare triple {11376#false} assume !(20480 == #t~mem52);havoc #t~mem52;call #t~mem53 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,775 INFO L290 TraceCheckUtils]: 85: Hoare triple {11376#false} assume !(4099 == #t~mem53);havoc #t~mem53;call #t~mem54 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,776 INFO L290 TraceCheckUtils]: 86: Hoare triple {11376#false} assume !(4368 == #t~mem54);havoc #t~mem54;call #t~mem55 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,777 INFO L290 TraceCheckUtils]: 87: Hoare triple {11376#false} assume !(4369 == #t~mem55);havoc #t~mem55;call #t~mem56 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,777 INFO L290 TraceCheckUtils]: 88: Hoare triple {11376#false} assume !(4384 == #t~mem56);havoc #t~mem56;call #t~mem57 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,777 INFO L290 TraceCheckUtils]: 89: Hoare triple {11376#false} assume !(4385 == #t~mem57);havoc #t~mem57;call #t~mem58 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,777 INFO L290 TraceCheckUtils]: 90: Hoare triple {11376#false} assume !(4400 == #t~mem58);havoc #t~mem58;call #t~mem59 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,777 INFO L290 TraceCheckUtils]: 91: Hoare triple {11376#false} assume !(4401 == #t~mem59);havoc #t~mem59;call #t~mem60 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,779 INFO L290 TraceCheckUtils]: 92: Hoare triple {11376#false} assume !(4416 == #t~mem60);havoc #t~mem60;call #t~mem61 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,779 INFO L290 TraceCheckUtils]: 93: Hoare triple {11376#false} assume !(4417 == #t~mem61);havoc #t~mem61;call #t~mem62 := read~int(~s.base, 72 + ~s.offset, 4); {11376#false} is VALID [2022-04-08 15:11:30,779 INFO L290 TraceCheckUtils]: 94: Hoare triple {11376#false} assume 4432 == #t~mem62;havoc #t~mem62; {11376#false} is VALID [2022-04-08 15:11:30,779 INFO L290 TraceCheckUtils]: 95: Hoare triple {11376#false} assume -2147483648 <= #t~nondet99 && #t~nondet99 <= 2147483647;~ret~0 := #t~nondet99;havoc #t~nondet99; {11376#false} is VALID [2022-04-08 15:11:30,779 INFO L290 TraceCheckUtils]: 96: Hoare triple {11376#false} assume 4 == ~blastFlag~0; {11376#false} is VALID [2022-04-08 15:11:30,779 INFO L290 TraceCheckUtils]: 97: Hoare triple {11376#false} assume !false; {11376#false} is VALID [2022-04-08 15:11:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-08 15:11:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 15:11:30,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333392504] [2022-04-08 15:11:30,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333392504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:30,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:30,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:30,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 15:11:30,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1308770732] [2022-04-08 15:11:30,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1308770732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 15:11:30,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 15:11:30,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 15:11:30,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033459961] [2022-04-08 15:11:30,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 15:11:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 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 15:11:30,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 15:11:30,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:30,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:30,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 15:11:30,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:30,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 15:11:30,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 15:11:30,844 INFO L87 Difference]: Start difference. First operand 468 states and 730 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:32,861 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 15:11:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:33,742 INFO L93 Difference]: Finished difference Result 922 states and 1449 transitions. [2022-04-08 15:11:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 15:11:33,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 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 15:11:33,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 15:11:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 15:11:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-04-08 15:11:33,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-04-08 15:11:34,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:34,081 INFO L225 Difference]: With dead ends: 922 [2022-04-08 15:11:34,081 INFO L226 Difference]: Without dead ends: 619 [2022-04-08 15:11:34,081 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 15:11:34,082 INFO L913 BasicCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-08 15:11:34,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 477 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-08 15:11:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-08 15:11:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2022-04-08 15:11:34,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 15:11:34,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:34,100 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:34,101 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:34,115 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-08 15:11:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-08 15:11:34,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:34,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:34,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 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 619 states. [2022-04-08 15:11:34,118 INFO L87 Difference]: Start difference. First operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 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 619 states. [2022-04-08 15:11:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 15:11:34,133 INFO L93 Difference]: Finished difference Result 619 states and 966 transitions. [2022-04-08 15:11:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-08 15:11:34,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 15:11:34,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 15:11:34,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 15:11:34,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 15:11:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 614 states have (on average 1.5667752442996743) internal successors, (962), 614 states have internal predecessors, (962), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 966 transitions. [2022-04-08 15:11:34,153 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 966 transitions. Word has length 98 [2022-04-08 15:11:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 15:11:34,153 INFO L478 AbstractCegarLoop]: Abstraction has 619 states and 966 transitions. [2022-04-08 15:11:34,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 15:11:34,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 619 states and 966 transitions. [2022-04-08 15:11:34,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 966 edges. 966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 15:11:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 966 transitions. [2022-04-08 15:11:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-08 15:11:34,854 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 15:11:34,854 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] [2022-04-08 15:11:34,854 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 15:11:34,854 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 15:11:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 15:11:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 1 times [2022-04-08 15:11:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 15:11:34,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [331752841] [2022-04-08 15:11:34,855 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 15:11:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2136926065, now seen corresponding path program 2 times [2022-04-08 15:11:34,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 15:11:34,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678245353] [2022-04-08 15:11:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 15:11:34,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 15:11:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:11:36,709 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 15:11:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 15:11:36,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 15:11:36,964 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 15:11:36,964 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 15:11:36,967 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 15:11:36,969 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 15:11:36,971 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-08 15:11:36,973 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 15:11:37,013 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 15:11:37,013 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: ssl3_get_client_methodENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: ssl3_connectENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: sslv3_base_methodENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: SSLv3_client_methodENTRY has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1044 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1132 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1098 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1675 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1061 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: L1046 has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: ssl3_get_client_methodFINAL has no Hoare annotation [2022-04-08 15:11:37,014 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1135-2 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1135 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1098-1 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L-1-3 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1675-1 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1064 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1061-2 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1046-1 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1142 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyFINAL has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: sslv3_base_methodFINAL has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1064-1 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: SSLv3_client_methodFINAL has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1143 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1152-1 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: #Ultimate.C_memcpyEXIT has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: sslv3_base_methodEXIT has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1066 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: SSLv3_client_methodEXIT has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1655 has no Hoare annotation [2022-04-08 15:11:37,015 WARN L170 areAnnotationChecker]: L1153 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1066-1 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1659 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1155 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1659-2 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1156 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1158 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: ssl3_connectFINAL has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1261 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1161 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: ssl3_connectEXIT has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1266 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1164 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1266-2 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1167 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1271 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1170 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1278 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1174 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1173 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1280 has no Hoare annotation [2022-04-08 15:11:37,016 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1278-2 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1316 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1176 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1286 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1302 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1319-2 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1319-2 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1319 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1319 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1180 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1179 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1588 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1332 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1332 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1341 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1341 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1182 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1624 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1341-2 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1341-2 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1186 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1185 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-08 15:11:37,017 WARN L170 areAnnotationChecker]: L1625 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1624-1 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1351 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1360 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1188 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1626 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1351-2 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1360-2 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1364 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1192 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1191 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1628 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1626-2 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1364-2 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1381 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1194 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1637 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1381-2 has no Hoare annotation [2022-04-08 15:11:37,018 WARN L170 areAnnotationChecker]: L1198 has no Hoare annotation [2022-04-08 15:11:37,019 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-08 15:11:37,019 WARN L170 areAnnotationChecker]: L1197 has no Hoare annotation [2022-04-08 15:11:37,019 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-08 15:11:37,019 WARN L170 areAnnotationChecker]: L1393 has no Hoare annotation [2022-04-08 15:11:37,019 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-08 15:11:37,019 WARN L170 areAnnotationChecker]: L1403 has no Hoare annotation [2022-04-08 15:11:37,019 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-08 15:11:37,019 WARN L170 areAnnotationChecker]: L1200 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1404 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1408 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1204 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1203 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1419 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1206 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1424 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1216 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1209 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1424-2 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1436 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1212 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1215 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1218 has no Hoare annotation [2022-04-08 15:11:37,020 WARN L170 areAnnotationChecker]: L1222 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1221 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1447 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1224 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1453 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1228 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1227 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1453-2 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1464 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1230 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1234 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1233 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1476 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1236 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1484 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1240 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1239 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1484-2 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1505 has no Hoare annotation [2022-04-08 15:11:37,021 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1242 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1495 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1512 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1246 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1245 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1514 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1512-1 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1529 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1248 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1534 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1249 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1251 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1534-2 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1545 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1542-1 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1252 has no Hoare annotation [2022-04-08 15:11:37,022 WARN L170 areAnnotationChecker]: L1255 has no Hoare annotation [2022-04-08 15:11:37,023 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-08 15:11:37,023 WARN L170 areAnnotationChecker]: L1558 has no Hoare annotation [2022-04-08 15:11:37,023 WARN L170 areAnnotationChecker]: L1558-2 has no Hoare annotation [2022-04-08 15:11:37,023 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-08 15:11:37,023 WARN L170 areAnnotationChecker]: L1563 has no Hoare annotation [2022-04-08 15:11:37,023 WARN L170 areAnnotationChecker]: L1563-2 has no Hoare annotation [2022-04-08 15:11:37,024 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-08 15:11:37,024 WARN L170 areAnnotationChecker]: L1570 has no Hoare annotation [2022-04-08 15:11:37,024 WARN L170 areAnnotationChecker]: L1570-2 has no Hoare annotation [2022-04-08 15:11:37,024 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-08 15:11:37,024 WARN L170 areAnnotationChecker]: L1578 has no Hoare annotation [2022-04-08 15:11:37,024 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 15:11:37,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 03:11:37 BoogieIcfgContainer [2022-04-08 15:11:37,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 15:11:37,026 INFO L158 Benchmark]: Toolchain (without parser) took 29248.21ms. Allocated memory was 190.8MB in the beginning and 398.5MB in the end (delta: 207.6MB). Free memory was 137.2MB in the beginning and 261.0MB in the end (delta: -123.9MB). Peak memory consumption was 176.9MB. Max. memory is 8.0GB. [2022-04-08 15:11:37,026 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory was 155.6MB in the beginning and 155.5MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 15:11:37,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 483.85ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 136.9MB in the beginning and 183.4MB in the end (delta: -46.5MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2022-04-08 15:11:37,026 INFO L158 Benchmark]: Boogie Preprocessor took 99.58ms. Allocated memory is still 229.6MB. Free memory was 183.4MB in the beginning and 174.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-08 15:11:37,027 INFO L158 Benchmark]: RCFGBuilder took 2131.99ms. Allocated memory is still 229.6MB. Free memory was 174.0MB in the beginning and 154.8MB in the end (delta: 19.2MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. [2022-04-08 15:11:37,027 INFO L158 Benchmark]: TraceAbstraction took 26524.73ms. Allocated memory was 229.6MB in the beginning and 398.5MB in the end (delta: 168.8MB). Free memory was 154.2MB in the beginning and 261.0MB in the end (delta: -106.8MB). Peak memory consumption was 153.1MB. Max. memory is 8.0GB. [2022-04-08 15:11:37,028 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 190.8MB. Free memory was 155.6MB in the beginning and 155.5MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 483.85ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 136.9MB in the beginning and 183.4MB in the end (delta: -46.5MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 99.58ms. Allocated memory is still 229.6MB. Free memory was 183.4MB in the beginning and 174.4MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 2131.99ms. Allocated memory is still 229.6MB. Free memory was 174.0MB in the beginning and 154.8MB in the end (delta: 19.2MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. * TraceAbstraction took 26524.73ms. Allocated memory was 229.6MB in the beginning and 398.5MB in the end (delta: 168.8MB). Free memory was 154.2MB in the beginning and 261.0MB in the end (delta: -106.8MB). Peak memory consumption was 153.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1665]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 1360. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; [L1077] SSL *s = (SSL*)malloc(sizeof(SSL)) ; [L1081] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1082] s->ctx = malloc(sizeof(SSL_CTX)) [L1083] s->session = malloc(sizeof(SSL_SESSION)) [L1084] s->state = 12292 [L1085] s->version = __VERIFIER_nondet_int() [L1087] s->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1088] EXPR s->ctx [L1088] (s->ctx)->info_callback = (void (*)()) __VERIFIER_nondet_ulong() [L1089] s->init_buf = (BUF_MEM *)__VERIFIER_nondet_ulong() [L1090] s->bbio = (BIO *) __VERIFIER_nondet_ulong() [L1091] s->wbio = (BIO *) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->flags = __VERIFIER_nondet_long() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.cert_req = __VERIFIER_nondet_int() [L1094] EXPR s->s3 [L1094] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1096] EXPR s->s3 [L1096] (s->s3)->tmp.next_state = __VERIFIER_nondet_int() [L1098] CALL ssl3_connect(s) [L1104] BUF_MEM *buf ; [L1105] unsigned long tmp ; [L1106] unsigned long l ; [L1107] long num1 ; [L1108] void (*cb)() ; [L1109] int ret ; [L1110] int new_state ; [L1111] int state ; [L1112] int skip ; [L1113] int tmp___1 = __VERIFIER_nondet_int() ; [L1114] int tmp___2 = __VERIFIER_nondet_int() ; [L1115] int tmp___3 = __VERIFIER_nondet_int() ; [L1116] int tmp___4 = __VERIFIER_nondet_int() ; [L1117] int tmp___5 = __VERIFIER_nondet_int() ; [L1118] int tmp___6 = __VERIFIER_nondet_int() ; [L1119] int tmp___7 = __VERIFIER_nondet_int() ; [L1120] int tmp___8 = __VERIFIER_nondet_int() ; [L1121] long tmp___9 = __VERIFIER_nondet_long() ; [L1122] int blastFlag ; [L1125] blastFlag = 0 [L1126] s->hit=__VERIFIER_nondet_int () [L1127] s->state = 12292 [L1128] tmp = __VERIFIER_nondet_int() [L1129] cb = (void (*)())((void *)0) [L1130] ret = -1 [L1131] skip = 0 [L1132] EXPR s->info_callback [L1132] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1133] EXPR s->info_callback [L1133] cb = s->info_callback [L1141] EXPR s->in_handshake [L1141] s->in_handshake += 1 [L1142] COND FALSE !(tmp___1 & 12288) [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND TRUE s->state == 12292 [L1258] s->new_session = 1 [L1259] s->state = 4096 [L1260] EXPR s->ctx [L1260] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1260] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1265] s->server = 0 [L1266] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) [L1271] EXPR s->version [L1271] COND FALSE !((s->version & 65280) != 768) [L1277] s->type = 4096 [L1278] EXPR s->init_buf [L1278] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1296] COND FALSE !(! tmp___4) [L1302] COND FALSE !(! tmp___5) [L1308] s->state = 4368 [L1309] EXPR s->ctx [L1309] EXPR (s->ctx)->stats.sess_connect [L1309] (s->ctx)->stats.sess_connect += 1 [L1310] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND TRUE s->state == 4368 [L1314] s->shutdown = 0 [L1315] ret = __VERIFIER_nondet_int() [L1316] COND TRUE blastFlag == 0 [L1317] blastFlag = 1 [L1325] COND FALSE !(ret <= 0) [L1330] s->state = 4384 [L1331] s->init_num = 0 [L1332] EXPR s->bbio [L1332] EXPR s->wbio [L1332] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND TRUE s->state == 4384 [L1340] ret = __VERIFIER_nondet_int() [L1341] COND TRUE blastFlag == 1 [L1342] blastFlag = 2 [L1346] COND FALSE !(ret <= 0) [L1351] s->hit [L1351] COND FALSE !(s->hit) [L1354] s->state = 4400 [L1356] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND TRUE s->state == 4400 [L1360] EXPR s->s3 [L1360] EXPR (s->s3)->tmp.new_cipher [L1360] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1360] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1363] ret = __VERIFIER_nondet_int() [L1364] COND TRUE blastFlag == 2 [L1365] blastFlag = 3 [L1369] COND FALSE !(ret <= 0) [L1375] s->state = 4416 [L1376] s->init_num = 0 [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND TRUE s->state == 4416 [L1380] ret = __VERIFIER_nondet_int() [L1381] COND TRUE blastFlag == 3 [L1382] blastFlag = 4 [L1386] COND FALSE !(ret <= 0) [L1391] s->state = 4432 [L1392] s->init_num = 0 [L1393] COND FALSE !(! tmp___6) [L1624] EXPR s->s3 [L1624] EXPR (s->s3)->tmp.reuse_message [L1624] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1653] skip = 0 [L1152] COND TRUE 1 [L1154] EXPR s->state [L1154] state = s->state [L1155] EXPR s->state [L1155] COND FALSE !(s->state == 12292) [L1158] EXPR s->state [L1158] COND FALSE !(s->state == 16384) [L1161] EXPR s->state [L1161] COND FALSE !(s->state == 4096) [L1164] EXPR s->state [L1164] COND FALSE !(s->state == 20480) [L1167] EXPR s->state [L1167] COND FALSE !(s->state == 4099) [L1170] EXPR s->state [L1170] COND FALSE !(s->state == 4368) [L1173] EXPR s->state [L1173] COND FALSE !(s->state == 4369) [L1176] EXPR s->state [L1176] COND FALSE !(s->state == 4384) [L1179] EXPR s->state [L1179] COND FALSE !(s->state == 4385) [L1182] EXPR s->state [L1182] COND FALSE !(s->state == 4400) [L1185] EXPR s->state [L1185] COND FALSE !(s->state == 4401) [L1188] EXPR s->state [L1188] COND FALSE !(s->state == 4416) [L1191] EXPR s->state [L1191] COND FALSE !(s->state == 4417) [L1194] EXPR s->state [L1194] COND TRUE s->state == 4432 [L1402] ret = __VERIFIER_nondet_int() [L1403] COND TRUE blastFlag == 4 [L1665] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.4s, OverallIterations: 7, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 13.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 596 mSDsluCounter, 2378 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1182 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1944 IncrementalHoareTripleChecker+Invalid, 2063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 1196 mSDtfsCounter, 1944 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=619occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 267 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-08 15:11:37,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...