/usr/bin/java -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 00:40:55,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 00:40:55,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 00:40:55,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 00:40:55,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 00:40:55,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 00:40:55,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 00:40:55,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 00:40:55,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 00:40:55,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 00:40:55,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 00:40:55,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 00:40:55,997 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 00:40:55,999 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 00:40:56,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 00:40:56,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 00:40:56,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 00:40:56,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 00:40:56,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 00:40:56,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 00:40:56,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 00:40:56,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 00:40:56,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 00:40:56,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 00:40:56,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 00:40:56,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 00:40:56,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 00:40:56,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 00:40:56,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 00:40:56,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 00:40:56,020 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 00:40:56,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 00:40:56,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 00:40:56,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 00:40:56,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 00:40:56,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 00:40:56,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 00:40:56,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 00:40:56,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 00:40:56,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 00:40:56,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 00:40:56,025 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-15 00:40:56,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 00:40:56,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 00:40:56,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 00:40:56,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 00:40:56,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 00:40:56,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 00:40:56,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 00:40:56,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 00:40:56,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 00:40:56,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 00:40:56,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 00:40:56,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 00:40:56,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 00:40:56,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 00:40:56,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 00:40:56,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 00:40:56,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 00:40:56,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 00:40:56,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:40:56,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 00:40:56,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 00:40:56,038 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-15 00:40:56,038 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-02-15 00:40:56,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 00:40:56,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 00:40:56,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 00:40:56,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 00:40:56,293 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 00:40:56,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-02-15 00:40:56,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e989d2f/81bf0f9e3f90473083c457288387aa91/FLAGace825365 [2022-02-15 00:40:56,814 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 00:40:56,814 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c [2022-02-15 00:40:56,832 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e989d2f/81bf0f9e3f90473083c457288387aa91/FLAGace825365 [2022-02-15 00:40:57,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81e989d2f/81bf0f9e3f90473083c457288387aa91 [2022-02-15 00:40:57,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 00:40:57,195 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 00:40:57,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 00:40:57,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 00:40:57,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 00:40:57,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dcda5eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57, skipping insertion in model container [2022-02-15 00:40:57,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 00:40:57,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 00:40:57,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-02-15 00:40:57,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:40:57,580 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 00:40:57,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_clnt.blast.01.i.cil-2.c[65520,65533] [2022-02-15 00:40:57,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:40:57,668 INFO L208 MainTranslator]: Completed translation [2022-02-15 00:40:57,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57 WrapperNode [2022-02-15 00:40:57,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 00:40:57,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 00:40:57,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 00:40:57,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 00:40:57,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 00:40:57,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 00:40:57,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 00:40:57,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 00:40:57,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57" (1/1) ... [2022-02-15 00:40:57,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:40:57,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:40:57,845 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-02-15 00:40:57,865 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-02-15 00:40:57,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 00:40:57,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 00:40:57,883 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 00:40:57,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2022-02-15 00:40:57,883 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2022-02-15 00:40:57,883 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 00:40:57,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2022-02-15 00:40:57,884 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-02-15 00:40:57,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-15 00:40:57,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-15 00:40:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 00:40:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 00:40:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 00:40:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 00:40:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-02-15 00:40:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-15 00:40:57,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-15 00:40:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 00:40:58,025 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 00:40:58,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 00:40:59,554 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:40:59,851 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2022-02-15 00:40:59,852 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2022-02-15 00:40:59,860 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 00:40:59,865 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 00:40:59,865 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 00:40:59,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:40:59 BoogieIcfgContainer [2022-02-15 00:40:59,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 00:40:59,866 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-15 00:40:59,867 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-15 00:40:59,867 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-15 00:40:59,869 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:40:59" (1/1) ... [2022-02-15 00:40:59,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:40:59 BasicIcfg [2022-02-15 00:40:59,894 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-15 00:40:59,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 00:40:59,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 00:40:59,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 00:40:59,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:40:57" (1/4) ... [2022-02-15 00:40:59,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d597092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:40:59, skipping insertion in model container [2022-02-15 00:40:59,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:40:57" (2/4) ... [2022-02-15 00:40:59,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d597092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:40:59, skipping insertion in model container [2022-02-15 00:40:59,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:40:59" (3/4) ... [2022-02-15 00:40:59,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d597092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:40:59, skipping insertion in model container [2022-02-15 00:40:59,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:40:59" (4/4) ... [2022-02-15 00:40:59,899 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01.i.cil-2.cJordan [2022-02-15 00:40:59,902 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-15 00:40:59,902 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 00:40:59,927 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 00:40:59,931 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-15 00:40:59,931 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 00:40:59,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 00:40:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-15 00:40:59,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:40:59,947 INFO L514 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-02-15 00:40:59,947 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:40:59,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:40:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1407118819, now seen corresponding path program 1 times [2022-02-15 00:40:59,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:40:59,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207095746] [2022-02-15 00:40:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:40:59,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:00,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:00,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:41:00,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:00,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207095746] [2022-02-15 00:41:00,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207095746] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:00,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:00,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:00,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810757668] [2022-02-15 00:41:00,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:00,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:00,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:00,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:00,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:00,540 INFO L87 Difference]: Start difference. First operand has 140 states, 132 states have (on average 1.6742424242424243) internal successors, (221), 133 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:02,567 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-02-15 00:41:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:02,881 INFO L93 Difference]: Finished difference Result 144 states and 228 transitions. [2022-02-15 00:41:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:02,883 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-02-15 00:41:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:02,889 INFO L225 Difference]: With dead ends: 144 [2022-02-15 00:41:02,889 INFO L226 Difference]: Without dead ends: 124 [2022-02-15 00:41:02,890 INFO L932 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-02-15 00:41:02,898 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:02,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 558 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:02,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-15 00:41:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-02-15 00:41:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 118 states have internal predecessors, (176), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:02,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2022-02-15 00:41:02,943 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 30 [2022-02-15 00:41:02,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:02,943 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2022-02-15 00:41:02,943 INFO L471 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-02-15 00:41:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2022-02-15 00:41:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-15 00:41:02,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:02,944 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:02,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 00:41:02,945 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -765789009, now seen corresponding path program 1 times [2022-02-15 00:41:02,945 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:02,945 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020663573] [2022-02-15 00:41:02,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:03,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:03,136 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:03,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020663573] [2022-02-15 00:41:03,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020663573] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:03,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:03,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:41:03,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812842550] [2022-02-15 00:41:03,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:03,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:03,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:03,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:41:03,138 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:05,153 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-02-15 00:41:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:05,436 INFO L93 Difference]: Finished difference Result 226 states and 330 transitions. [2022-02-15 00:41:05,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:05,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-02-15 00:41:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:05,438 INFO L225 Difference]: With dead ends: 226 [2022-02-15 00:41:05,438 INFO L226 Difference]: Without dead ends: 226 [2022-02-15 00:41:05,439 INFO L932 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-02-15 00:41:05,439 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 125 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:05,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 323 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-02-15 00:41:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2022-02-15 00:41:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.4751131221719458) internal successors, (326), 221 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 330 transitions. [2022-02-15 00:41:05,449 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 330 transitions. Word has length 45 [2022-02-15 00:41:05,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:05,449 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 330 transitions. [2022-02-15 00:41:05,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:05,449 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 330 transitions. [2022-02-15 00:41:05,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-15 00:41:05,450 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:05,451 INFO L514 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-02-15 00:41:05,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 00:41:05,451 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:05,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:05,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1602004893, now seen corresponding path program 1 times [2022-02-15 00:41:05,451 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:05,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263712743] [2022-02-15 00:41:05,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:05,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:05,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:05,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263712743] [2022-02-15 00:41:05,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263712743] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:05,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:05,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:05,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046476803] [2022-02-15 00:41:05,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:05,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:05,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:05,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:05,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:05,739 INFO L87 Difference]: Start difference. First operand 226 states and 330 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:07,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:08,177 INFO L93 Difference]: Finished difference Result 411 states and 606 transitions. [2022-02-15 00:41:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:08,177 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-02-15 00:41:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:08,179 INFO L225 Difference]: With dead ends: 411 [2022-02-15 00:41:08,179 INFO L226 Difference]: Without dead ends: 411 [2022-02-15 00:41:08,180 INFO L932 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-02-15 00:41:08,180 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 107 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 44 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:08,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 285 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 385 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:41:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-02-15 00:41:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 274. [2022-02-15 00:41:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 269 states have (on average 1.5241635687732342) internal successors, (410), 269 states have internal predecessors, (410), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 414 transitions. [2022-02-15 00:41:08,191 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 414 transitions. Word has length 60 [2022-02-15 00:41:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:08,192 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 414 transitions. [2022-02-15 00:41:08,192 INFO L471 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-02-15 00:41:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 414 transitions. [2022-02-15 00:41:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-15 00:41:08,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:08,194 INFO L514 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, 1] [2022-02-15 00:41:08,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 00:41:08,194 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:08,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:08,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1876508687, now seen corresponding path program 1 times [2022-02-15 00:41:08,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:08,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707575376] [2022-02-15 00:41:08,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:08,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:08,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:08,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:08,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707575376] [2022-02-15 00:41:08,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707575376] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:08,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:08,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:08,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923973007] [2022-02-15 00:41:08,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:08,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:08,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:08,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:08,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:08,342 INFO L87 Difference]: Start difference. First operand 274 states and 414 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:10,357 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-02-15 00:41:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:10,723 INFO L93 Difference]: Finished difference Result 309 states and 466 transitions. [2022-02-15 00:41:10,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:10,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-02-15 00:41:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:10,725 INFO L225 Difference]: With dead ends: 309 [2022-02-15 00:41:10,725 INFO L226 Difference]: Without dead ends: 309 [2022-02-15 00:41:10,725 INFO L932 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-02-15 00:41:10,726 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 31 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:10,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 490 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:41:10,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-02-15 00:41:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 292. [2022-02-15 00:41:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 287 states have (on average 1.5331010452961673) internal successors, (440), 287 states have internal predecessors, (440), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 444 transitions. [2022-02-15 00:41:10,734 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 444 transitions. Word has length 61 [2022-02-15 00:41:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:10,734 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 444 transitions. [2022-02-15 00:41:10,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:10,734 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 444 transitions. [2022-02-15 00:41:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-15 00:41:10,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:10,736 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:10,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 00:41:10,736 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:10,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1234412191, now seen corresponding path program 2 times [2022-02-15 00:41:10,737 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:10,737 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602313865] [2022-02-15 00:41:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:10,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:10,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:10,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:10,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602313865] [2022-02-15 00:41:10,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602313865] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:10,937 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:10,937 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:10,937 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313432793] [2022-02-15 00:41:10,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:10,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:10,938 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:10,938 INFO L87 Difference]: Start difference. First operand 292 states and 444 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:12,955 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-02-15 00:41:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:13,263 INFO L93 Difference]: Finished difference Result 475 states and 715 transitions. [2022-02-15 00:41:13,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:13,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-02-15 00:41:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:13,266 INFO L225 Difference]: With dead ends: 475 [2022-02-15 00:41:13,266 INFO L226 Difference]: Without dead ends: 475 [2022-02-15 00:41:13,266 INFO L932 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-02-15 00:41:13,266 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 113 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:13,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 302 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 381 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:13,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-02-15 00:41:13,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 314. [2022-02-15 00:41:13,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5177993527508091) internal successors, (469), 309 states have internal predecessors, (469), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 473 transitions. [2022-02-15 00:41:13,276 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 473 transitions. Word has length 76 [2022-02-15 00:41:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:13,276 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 473 transitions. [2022-02-15 00:41:13,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 473 transitions. [2022-02-15 00:41:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-15 00:41:13,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:13,278 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:13,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 00:41:13,278 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:13,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1335598719, now seen corresponding path program 1 times [2022-02-15 00:41:13,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:13,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075098447] [2022-02-15 00:41:13,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:13,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:13,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:13,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:13,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075098447] [2022-02-15 00:41:13,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075098447] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:13,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:13,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:13,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194118482] [2022-02-15 00:41:13,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:13,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:13,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:13,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:13,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:13,497 INFO L87 Difference]: Start difference. First operand 314 states and 473 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:15,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:17,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:19,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:21,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:21,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:21,492 INFO L93 Difference]: Finished difference Result 330 states and 493 transitions. [2022-02-15 00:41:21,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:21,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-02-15 00:41:21,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:21,493 INFO L225 Difference]: With dead ends: 330 [2022-02-15 00:41:21,493 INFO L226 Difference]: Without dead ends: 330 [2022-02-15 00:41:21,494 INFO L932 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-02-15 00:41:21,494 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 35 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:21,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 488 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 3 Unknown, 0 Unchecked, 8.0s Time] [2022-02-15 00:41:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-15 00:41:21,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 314. [2022-02-15 00:41:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5145631067961165) internal successors, (468), 309 states have internal predecessors, (468), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 472 transitions. [2022-02-15 00:41:21,499 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 472 transitions. Word has length 76 [2022-02-15 00:41:21,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:21,500 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 472 transitions. [2022-02-15 00:41:21,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 472 transitions. [2022-02-15 00:41:21,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-15 00:41:21,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:21,501 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:21,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 00:41:21,501 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:21,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash -572396012, now seen corresponding path program 1 times [2022-02-15 00:41:21,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:21,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907340879] [2022-02-15 00:41:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:21,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:21,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:21,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:21,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907340879] [2022-02-15 00:41:21,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907340879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:21,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:21,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:21,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009303530] [2022-02-15 00:41:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:21,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:21,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:21,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:21,648 INFO L87 Difference]: Start difference. First operand 314 states and 472 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:23,658 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-02-15 00:41:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:23,937 INFO L93 Difference]: Finished difference Result 330 states and 492 transitions. [2022-02-15 00:41:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:23,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-02-15 00:41:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:23,938 INFO L225 Difference]: With dead ends: 330 [2022-02-15 00:41:23,939 INFO L226 Difference]: Without dead ends: 330 [2022-02-15 00:41:23,939 INFO L932 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-02-15 00:41:23,939 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:23,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 486 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-15 00:41:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 314. [2022-02-15 00:41:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 309 states have (on average 1.5113268608414239) internal successors, (467), 309 states have internal predecessors, (467), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 471 transitions. [2022-02-15 00:41:23,945 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 471 transitions. Word has length 77 [2022-02-15 00:41:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:23,945 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 471 transitions. [2022-02-15 00:41:23,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 471 transitions. [2022-02-15 00:41:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-15 00:41:23,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:23,946 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:23,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 00:41:23,946 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash 958828699, now seen corresponding path program 1 times [2022-02-15 00:41:23,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:23,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798522763] [2022-02-15 00:41:23,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:23,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:24,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:24,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:24,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798522763] [2022-02-15 00:41:24,133 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798522763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:24,133 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:24,133 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:24,133 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111227493] [2022-02-15 00:41:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:24,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:24,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:24,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:24,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:24,134 INFO L87 Difference]: Start difference. First operand 314 states and 471 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:26,142 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-02-15 00:41:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:26,501 INFO L93 Difference]: Finished difference Result 476 states and 709 transitions. [2022-02-15 00:41:26,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:26,502 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-02-15 00:41:26,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:26,503 INFO L225 Difference]: With dead ends: 476 [2022-02-15 00:41:26,503 INFO L226 Difference]: Without dead ends: 476 [2022-02-15 00:41:26,504 INFO L932 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-02-15 00:41:26,504 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 118 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:26,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 284 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 384 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-02-15 00:41:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 320. [2022-02-15 00:41:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 315 states have (on average 1.5047619047619047) internal successors, (474), 315 states have internal predecessors, (474), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 478 transitions. [2022-02-15 00:41:26,510 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 478 transitions. Word has length 78 [2022-02-15 00:41:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:26,510 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 478 transitions. [2022-02-15 00:41:26,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 478 transitions. [2022-02-15 00:41:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-15 00:41:26,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:26,511 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:26,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 00:41:26,512 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:26,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash 820627690, now seen corresponding path program 1 times [2022-02-15 00:41:26,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:26,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875511193] [2022-02-15 00:41:26,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:26,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:26,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-02-15 00:41:26,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:26,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875511193] [2022-02-15 00:41:26,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875511193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:26,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:26,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:41:26,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641627254] [2022-02-15 00:41:26,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:26,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:26,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:26,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:26,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:41:26,643 INFO L87 Difference]: Start difference. First operand 320 states and 478 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:28,651 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-02-15 00:41:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:28,982 INFO L93 Difference]: Finished difference Result 480 states and 717 transitions. [2022-02-15 00:41:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:28,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-02-15 00:41:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:28,984 INFO L225 Difference]: With dead ends: 480 [2022-02-15 00:41:28,984 INFO L226 Difference]: Without dead ends: 480 [2022-02-15 00:41:28,985 INFO L932 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-02-15 00:41:28,985 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:28,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 483 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-02-15 00:41:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2022-02-15 00:41:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 475 states have (on average 1.5010526315789474) internal successors, (713), 475 states have internal predecessors, (713), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 717 transitions. [2022-02-15 00:41:28,992 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 717 transitions. Word has length 79 [2022-02-15 00:41:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:28,992 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 717 transitions. [2022-02-15 00:41:28,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 717 transitions. [2022-02-15 00:41:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-15 00:41:28,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:28,993 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:28,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 00:41:28,994 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1782241707, now seen corresponding path program 1 times [2022-02-15 00:41:28,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:28,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289027289] [2022-02-15 00:41:28,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:28,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:41:29,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:29,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289027289] [2022-02-15 00:41:29,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289027289] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:29,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:29,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:41:29,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131926364] [2022-02-15 00:41:29,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:29,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:29,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:29,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:29,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:41:29,169 INFO L87 Difference]: Start difference. First operand 480 states and 717 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:31,178 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-02-15 00:41:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:31,499 INFO L93 Difference]: Finished difference Result 638 states and 953 transitions. [2022-02-15 00:41:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:31,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-02-15 00:41:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:31,503 INFO L225 Difference]: With dead ends: 638 [2022-02-15 00:41:31,503 INFO L226 Difference]: Without dead ends: 638 [2022-02-15 00:41:31,504 INFO L932 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-02-15 00:41:31,504 INFO L933 BasicCegarLoop]: 312 mSDtfsCounter, 132 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:31,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 476 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 336 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-02-15 00:41:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2022-02-15 00:41:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 633 states have (on average 1.4992101105845181) internal successors, (949), 633 states have internal predecessors, (949), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 953 transitions. [2022-02-15 00:41:31,513 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 953 transitions. Word has length 79 [2022-02-15 00:41:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:31,513 INFO L470 AbstractCegarLoop]: Abstraction has 638 states and 953 transitions. [2022-02-15 00:41:31,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 953 transitions. [2022-02-15 00:41:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-15 00:41:31,517 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:31,518 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:31,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 00:41:31,518 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:31,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:31,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1134049869, now seen corresponding path program 1 times [2022-02-15 00:41:31,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:31,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657437376] [2022-02-15 00:41:31,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:31,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:31,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-02-15 00:41:31,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:31,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657437376] [2022-02-15 00:41:31,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657437376] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:31,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:31,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:41:31,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84762435] [2022-02-15 00:41:31,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:31,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:31,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:31,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:31,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:41:31,679 INFO L87 Difference]: Start difference. First operand 638 states and 953 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:33,686 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-02-15 00:41:34,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:34,009 INFO L93 Difference]: Finished difference Result 783 states and 1170 transitions. [2022-02-15 00:41:34,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:34,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-02-15 00:41:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:34,012 INFO L225 Difference]: With dead ends: 783 [2022-02-15 00:41:34,012 INFO L226 Difference]: Without dead ends: 783 [2022-02-15 00:41:34,012 INFO L932 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-02-15 00:41:34,013 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 127 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:34,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 482 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:34,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-02-15 00:41:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2022-02-15 00:41:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 778 states have (on average 1.4987146529562982) internal successors, (1166), 778 states have internal predecessors, (1166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1170 transitions. [2022-02-15 00:41:34,024 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1170 transitions. Word has length 99 [2022-02-15 00:41:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:34,024 INFO L470 AbstractCegarLoop]: Abstraction has 783 states and 1170 transitions. [2022-02-15 00:41:34,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:34,024 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1170 transitions. [2022-02-15 00:41:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-15 00:41:34,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:34,025 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:34,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 00:41:34,026 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash 951047844, now seen corresponding path program 1 times [2022-02-15 00:41:34,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:34,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974599735] [2022-02-15 00:41:34,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:41:34,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:34,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974599735] [2022-02-15 00:41:34,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974599735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:34,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:34,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:41:34,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973027186] [2022-02-15 00:41:34,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:34,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:34,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:34,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:41:34,213 INFO L87 Difference]: Start difference. First operand 783 states and 1170 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:36,220 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-02-15 00:41:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:36,591 INFO L93 Difference]: Finished difference Result 780 states and 1160 transitions. [2022-02-15 00:41:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-02-15 00:41:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:36,594 INFO L225 Difference]: With dead ends: 780 [2022-02-15 00:41:36,594 INFO L226 Difference]: Without dead ends: 780 [2022-02-15 00:41:36,594 INFO L932 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-02-15 00:41:36,594 INFO L933 BasicCegarLoop]: 315 mSDtfsCounter, 128 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:36,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 478 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 337 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:41:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-02-15 00:41:36,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2022-02-15 00:41:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 775 states have (on average 1.4916129032258065) internal successors, (1156), 775 states have internal predecessors, (1156), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:36,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1160 transitions. [2022-02-15 00:41:36,607 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1160 transitions. Word has length 119 [2022-02-15 00:41:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:36,607 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 1160 transitions. [2022-02-15 00:41:36,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1160 transitions. [2022-02-15 00:41:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-15 00:41:36,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:36,609 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:36,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 00:41:36,609 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash -840493056, now seen corresponding path program 1 times [2022-02-15 00:41:36,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:36,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031786108] [2022-02-15 00:41:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:36,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-02-15 00:41:36,787 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:36,787 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031786108] [2022-02-15 00:41:36,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031786108] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:36,787 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:36,787 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:36,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917422230] [2022-02-15 00:41:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:36,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:36,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:36,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:36,789 INFO L87 Difference]: Start difference. First operand 780 states and 1160 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:38,803 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-02-15 00:41:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:39,275 INFO L93 Difference]: Finished difference Result 1146 states and 1684 transitions. [2022-02-15 00:41:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:39,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 121 [2022-02-15 00:41:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:39,279 INFO L225 Difference]: With dead ends: 1146 [2022-02-15 00:41:39,279 INFO L226 Difference]: Without dead ends: 1146 [2022-02-15 00:41:39,279 INFO L932 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-02-15 00:41:39,280 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 97 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:39,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 575 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 545 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-02-15 00:41:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-02-15 00:41:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 864. [2022-02-15 00:41:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 859 states have (on average 1.4994179278230502) internal successors, (1288), 859 states have internal predecessors, (1288), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1292 transitions. [2022-02-15 00:41:39,296 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1292 transitions. Word has length 121 [2022-02-15 00:41:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:39,296 INFO L470 AbstractCegarLoop]: Abstraction has 864 states and 1292 transitions. [2022-02-15 00:41:39,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1292 transitions. [2022-02-15 00:41:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-02-15 00:41:39,298 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:39,298 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:39,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 00:41:39,298 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:39,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1448569919, now seen corresponding path program 1 times [2022-02-15 00:41:39,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:39,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047947412] [2022-02-15 00:41:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:39,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:39,486 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:41:39,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:39,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047947412] [2022-02-15 00:41:39,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047947412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:39,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:39,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:39,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076698082] [2022-02-15 00:41:39,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:39,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:39,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:39,488 INFO L87 Difference]: Start difference. First operand 864 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:41,497 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-02-15 00:41:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:41,824 INFO L93 Difference]: Finished difference Result 1010 states and 1489 transitions. [2022-02-15 00:41:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 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 121 [2022-02-15 00:41:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:41,827 INFO L225 Difference]: With dead ends: 1010 [2022-02-15 00:41:41,827 INFO L226 Difference]: Without dead ends: 1010 [2022-02-15 00:41:41,827 INFO L932 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-02-15 00:41:41,828 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 44 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:41,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 517 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 402 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2022-02-15 00:41:41,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 904. [2022-02-15 00:41:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 899 states have (on average 1.5172413793103448) internal successors, (1364), 899 states have internal predecessors, (1364), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1368 transitions. [2022-02-15 00:41:41,840 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1368 transitions. Word has length 121 [2022-02-15 00:41:41,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:41,840 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1368 transitions. [2022-02-15 00:41:41,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1368 transitions. [2022-02-15 00:41:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-02-15 00:41:41,841 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:41,841 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:41,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 00:41:41,842 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:41,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1313459171, now seen corresponding path program 1 times [2022-02-15 00:41:41,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:41,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885732190] [2022-02-15 00:41:41,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:41,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:42,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:41:42,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:42,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885732190] [2022-02-15 00:41:42,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885732190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:42,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:42,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:42,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427148816] [2022-02-15 00:41:42,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:42,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:42,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:42,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:42,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:42,006 INFO L87 Difference]: Start difference. First operand 904 states and 1368 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:44,013 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-02-15 00:41:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:44,326 INFO L93 Difference]: Finished difference Result 1235 states and 1808 transitions. [2022-02-15 00:41:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 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 136 [2022-02-15 00:41:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:44,330 INFO L225 Difference]: With dead ends: 1235 [2022-02-15 00:41:44,330 INFO L226 Difference]: Without dead ends: 1235 [2022-02-15 00:41:44,330 INFO L932 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-02-15 00:41:44,330 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:44,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 281 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:41:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2022-02-15 00:41:44,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 904. [2022-02-15 00:41:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 899 states have (on average 1.5027808676307008) internal successors, (1351), 899 states have internal predecessors, (1351), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1355 transitions. [2022-02-15 00:41:44,371 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1355 transitions. Word has length 136 [2022-02-15 00:41:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:44,371 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1355 transitions. [2022-02-15 00:41:44,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1355 transitions. [2022-02-15 00:41:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-02-15 00:41:44,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:44,373 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:44,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 00:41:44,373 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2146966014, now seen corresponding path program 1 times [2022-02-15 00:41:44,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:44,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359358958] [2022-02-15 00:41:44,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:44,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:44,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:41:44,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:44,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359358958] [2022-02-15 00:41:44,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359358958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:44,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:44,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:44,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753246577] [2022-02-15 00:41:44,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:44,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:44,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:44,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:44,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:44,571 INFO L87 Difference]: Start difference. First operand 904 states and 1355 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:46,579 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-02-15 00:41:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:46,950 INFO L93 Difference]: Finished difference Result 1235 states and 1795 transitions. [2022-02-15 00:41:46,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:46,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 137 [2022-02-15 00:41:46,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:46,955 INFO L225 Difference]: With dead ends: 1235 [2022-02-15 00:41:46,955 INFO L226 Difference]: Without dead ends: 1235 [2022-02-15 00:41:46,955 INFO L932 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-02-15 00:41:46,956 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 116 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:46,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 303 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:41:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2022-02-15 00:41:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 904. [2022-02-15 00:41:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 899 states have (on average 1.4883203559510567) internal successors, (1338), 899 states have internal predecessors, (1338), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1342 transitions. [2022-02-15 00:41:46,971 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1342 transitions. Word has length 137 [2022-02-15 00:41:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:46,971 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1342 transitions. [2022-02-15 00:41:46,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:46,971 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1342 transitions. [2022-02-15 00:41:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-02-15 00:41:46,973 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:46,973 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:46,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 00:41:46,973 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:46,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1231355719, now seen corresponding path program 1 times [2022-02-15 00:41:46,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:46,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996266494] [2022-02-15 00:41:46,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:46,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:47,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:41:47,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:47,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996266494] [2022-02-15 00:41:47,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996266494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:47,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:47,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:47,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267661726] [2022-02-15 00:41:47,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:47,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:47,172 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:47,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:47,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:47,173 INFO L87 Difference]: Start difference. First operand 904 states and 1342 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:48,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:50,507 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:52,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:54,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:41:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:54,903 INFO L93 Difference]: Finished difference Result 1331 states and 1938 transitions. [2022-02-15 00:41:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:41:54,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 139 [2022-02-15 00:41:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:54,907 INFO L225 Difference]: With dead ends: 1331 [2022-02-15 00:41:54,907 INFO L226 Difference]: Without dead ends: 1331 [2022-02-15 00:41:54,907 INFO L932 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-02-15 00:41:54,908 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 108 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 44 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:54,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 283 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 387 Invalid, 3 Unknown, 0 Unchecked, 7.7s Time] [2022-02-15 00:41:54,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2022-02-15 00:41:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 904. [2022-02-15 00:41:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 899 states have (on average 1.4827586206896552) internal successors, (1333), 899 states have internal predecessors, (1333), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:54,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1337 transitions. [2022-02-15 00:41:54,921 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1337 transitions. Word has length 139 [2022-02-15 00:41:54,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:54,922 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1337 transitions. [2022-02-15 00:41:54,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1337 transitions. [2022-02-15 00:41:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-02-15 00:41:54,923 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:54,924 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:54,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 00:41:54,924 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:54,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1142128455, now seen corresponding path program 1 times [2022-02-15 00:41:54,924 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:54,924 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720505601] [2022-02-15 00:41:54,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:54,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:55,095 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 157 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-02-15 00:41:55,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:55,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720505601] [2022-02-15 00:41:55,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720505601] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:41:55,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134668538] [2022-02-15 00:41:55,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:55,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:41:55,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:41:55,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:41:55,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-15 00:41:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:55,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 1690 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-15 00:41:55,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:41:56,084 INFO L353 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-02-15 00:41:56,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 91 [2022-02-15 00:41:56,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 35 [2022-02-15 00:41:56,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-02-15 00:41:56,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-02-15 00:41:56,249 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-02-15 00:41:56,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-02-15 00:41:56,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-15 00:41:56,311 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:41:56,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:41:56,379 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:41:56,380 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:41:56,410 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:41:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 123 proven. 40 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-02-15 00:41:56,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:41:56,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-02-15 00:41:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:41:56,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134668538] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:41:56,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:41:56,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-02-15 00:41:56,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588088790] [2022-02-15 00:41:56,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:56,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:41:56,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:41:56,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:41:56,645 INFO L87 Difference]: Start difference. First operand 904 states and 1337 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:58,651 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-02-15 00:41:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:41:58,862 INFO L93 Difference]: Finished difference Result 1235 states and 1777 transitions. [2022-02-15 00:41:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:41:58,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 139 [2022-02-15 00:41:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:41:58,865 INFO L225 Difference]: With dead ends: 1235 [2022-02-15 00:41:58,865 INFO L226 Difference]: Without dead ends: 1235 [2022-02-15 00:41:58,866 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:41:58,866 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 108 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:41:58,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 291 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 210 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-02-15 00:41:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2022-02-15 00:41:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 904. [2022-02-15 00:41:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 899 states have (on average 1.4682981090100111) internal successors, (1320), 899 states have internal predecessors, (1320), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1324 transitions. [2022-02-15 00:41:58,876 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1324 transitions. Word has length 139 [2022-02-15 00:41:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:41:58,876 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1324 transitions. [2022-02-15 00:41:58,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:41:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1324 transitions. [2022-02-15 00:41:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-02-15 00:41:58,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:41:58,878 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:41:58,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-15 00:41:59,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-15 00:41:59,099 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:41:59,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:41:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1758197537, now seen corresponding path program 1 times [2022-02-15 00:41:59,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:41:59,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021419196] [2022-02-15 00:41:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:41:59,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:41:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:59,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:41:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:41:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:41:59,265 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:41:59,265 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021419196] [2022-02-15 00:41:59,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021419196] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:41:59,265 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:41:59,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:41:59,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087983567] [2022-02-15 00:41:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:41:59,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:41:59,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:41:59,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:41:59,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:41:59,266 INFO L87 Difference]: Start difference. First operand 904 states and 1324 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:01,279 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-02-15 00:42:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:01,583 INFO L93 Difference]: Finished difference Result 974 states and 1397 transitions. [2022-02-15 00:42:01,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:01,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 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 139 [2022-02-15 00:42:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:01,586 INFO L225 Difference]: With dead ends: 974 [2022-02-15 00:42:01,586 INFO L226 Difference]: Without dead ends: 974 [2022-02-15 00:42:01,586 INFO L932 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-02-15 00:42:01,587 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 41 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:01,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 496 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 374 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:42:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-02-15 00:42:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 904. [2022-02-15 00:42:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 899 states have (on average 1.46384872080089) internal successors, (1316), 899 states have internal predecessors, (1316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1320 transitions. [2022-02-15 00:42:01,632 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1320 transitions. Word has length 139 [2022-02-15 00:42:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:01,632 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1320 transitions. [2022-02-15 00:42:01,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1320 transitions. [2022-02-15 00:42:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-02-15 00:42:01,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:01,634 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:01,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 00:42:01,634 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash 961502508, now seen corresponding path program 1 times [2022-02-15 00:42:01,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:01,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697414163] [2022-02-15 00:42:01,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:01,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:01,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 158 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-02-15 00:42:01,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:01,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697414163] [2022-02-15 00:42:01,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697414163] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:42:01,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262976719] [2022-02-15 00:42:01,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:01,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:42:01,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:42:01,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:42:01,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-15 00:42:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:02,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 1693 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-15 00:42:02,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:42:02,693 INFO L353 Elim1Store]: treesize reduction 54, result has 44.3 percent of original size [2022-02-15 00:42:02,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 91 [2022-02-15 00:42:02,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 35 [2022-02-15 00:42:02,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-02-15 00:42:02,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-02-15 00:42:02,780 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-15 00:42:02,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-02-15 00:42:02,809 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:42:02,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:42:02,882 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:42:02,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:42:02,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:42:02,962 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 126 proven. 40 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-02-15 00:42:02,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:42:03,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-02-15 00:42:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:42:03,177 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262976719] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:42:03,177 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:42:03,177 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2022-02-15 00:42:03,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113423230] [2022-02-15 00:42:03,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:03,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:42:03,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:03,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:42:03,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-15 00:42:03,178 INFO L87 Difference]: Start difference. First operand 904 states and 1320 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:04,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:42:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:04,953 INFO L93 Difference]: Finished difference Result 1231 states and 1755 transitions. [2022-02-15 00:42:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:42:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 140 [2022-02-15 00:42:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:04,957 INFO L225 Difference]: With dead ends: 1231 [2022-02-15 00:42:04,957 INFO L226 Difference]: Without dead ends: 1231 [2022-02-15 00:42:04,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-02-15 00:42:04,957 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 109 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:04,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 287 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 00:42:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2022-02-15 00:42:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 904. [2022-02-15 00:42:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 899 states have (on average 1.4493882091212458) internal successors, (1303), 899 states have internal predecessors, (1303), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:04,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1307 transitions. [2022-02-15 00:42:04,969 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1307 transitions. Word has length 140 [2022-02-15 00:42:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:04,970 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1307 transitions. [2022-02-15 00:42:04,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:04,970 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1307 transitions. [2022-02-15 00:42:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-02-15 00:42:04,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:04,972 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:05,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-15 00:42:05,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-02-15 00:42:05,195 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:05,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 772156782, now seen corresponding path program 1 times [2022-02-15 00:42:05,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:05,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957472068] [2022-02-15 00:42:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:05,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:42:05,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:05,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957472068] [2022-02-15 00:42:05,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957472068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:05,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:05,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:05,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173067766] [2022-02-15 00:42:05,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:05,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:05,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:05,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:05,359 INFO L87 Difference]: Start difference. First operand 904 states and 1307 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:07,373 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-02-15 00:42:07,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:07,658 INFO L93 Difference]: Finished difference Result 939 states and 1338 transitions. [2022-02-15 00:42:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:07,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 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 140 [2022-02-15 00:42:07,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:07,660 INFO L225 Difference]: With dead ends: 939 [2022-02-15 00:42:07,660 INFO L226 Difference]: Without dead ends: 939 [2022-02-15 00:42:07,660 INFO L932 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-02-15 00:42:07,661 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 23 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:07,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 476 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 346 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:42:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2022-02-15 00:42:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 904. [2022-02-15 00:42:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 899 states have (on average 1.4449388209121246) internal successors, (1299), 899 states have internal predecessors, (1299), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1303 transitions. [2022-02-15 00:42:07,669 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1303 transitions. Word has length 140 [2022-02-15 00:42:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:07,670 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1303 transitions. [2022-02-15 00:42:07,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1303 transitions. [2022-02-15 00:42:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-02-15 00:42:07,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:07,672 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:07,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 00:42:07,672 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash 144716696, now seen corresponding path program 1 times [2022-02-15 00:42:07,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:07,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422098149] [2022-02-15 00:42:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:07,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-15 00:42:08,604 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-15 00:42:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-15 00:42:09,020 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-15 00:42:09,020 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-15 00:42:09,021 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 00:42:09,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 00:42:09,024 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:09,026 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 00:42:09,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:42:09 BasicIcfg [2022-02-15 00:42:09,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 00:42:09,133 INFO L158 Benchmark]: Toolchain (without parser) took 71937.98ms. Allocated memory was 201.3MB in the beginning and 349.2MB in the end (delta: 147.8MB). Free memory was 178.6MB in the beginning and 271.2MB in the end (delta: -92.6MB). Peak memory consumption was 226.1MB. Max. memory is 8.0GB. [2022-02-15 00:42:09,133 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 00:42:09,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.21ms. Allocated memory is still 201.3MB. Free memory was 178.3MB in the beginning and 158.7MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-02-15 00:42:09,133 INFO L158 Benchmark]: Boogie Preprocessor took 108.20ms. Allocated memory is still 201.3MB. Free memory was 158.7MB in the beginning and 151.7MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-02-15 00:42:09,133 INFO L158 Benchmark]: RCFGBuilder took 2087.99ms. Allocated memory was 201.3MB in the beginning and 259.0MB in the end (delta: 57.7MB). Free memory was 151.4MB in the beginning and 161.0MB in the end (delta: -9.6MB). Peak memory consumption was 48.9MB. Max. memory is 8.0GB. [2022-02-15 00:42:09,133 INFO L158 Benchmark]: IcfgTransformer took 27.79ms. Allocated memory is still 259.0MB. Free memory was 161.0MB in the beginning and 156.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-02-15 00:42:09,133 INFO L158 Benchmark]: TraceAbstraction took 69237.18ms. Allocated memory was 259.0MB in the beginning and 349.2MB in the end (delta: 90.2MB). Free memory was 155.7MB in the beginning and 271.2MB in the end (delta: -115.5MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB. [2022-02-15 00:42:09,139 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 201.3MB. Free memory is still 167.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.21ms. Allocated memory is still 201.3MB. Free memory was 178.3MB in the beginning and 158.7MB in the end (delta: 19.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 108.20ms. Allocated memory is still 201.3MB. Free memory was 158.7MB in the beginning and 151.7MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2087.99ms. Allocated memory was 201.3MB in the beginning and 259.0MB in the end (delta: 57.7MB). Free memory was 151.4MB in the beginning and 161.0MB in the end (delta: -9.6MB). Peak memory consumption was 48.9MB. Max. memory is 8.0GB. * IcfgTransformer took 27.79ms. Allocated memory is still 259.0MB. Free memory was 161.0MB in the beginning and 156.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 69237.18ms. Allocated memory was 259.0MB in the beginning and 349.2MB in the end (delta: 90.2MB). Free memory was 155.7MB in the beginning and 271.2MB in the end (delta: -115.5MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1668]: 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 1353. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_client_data ; VAL [\old(init)=4294967309, \old(SSLv3_client_data)=null, \old(SSLv3_client_data)=null, init=1, SSLv3_client_data={4:0}] [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) VAL [init=1, s={-12:0}, SSLv3_client_data={4:0}] [L1104] BUF_MEM *buf = (BUF_MEM *)__VERIFIER_nondet_ulong(); [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 ; [L1116] int tmp___4 ; [L1117] int tmp___5 ; [L1118] int tmp___6 ; [L1119] int tmp___7 ; [L1120] int tmp___8 ; [L1121] long tmp___9 ; [L1123] int blastFlag ; [L1126] blastFlag = 0 [L1127] s->hit=__VERIFIER_nondet_int () [L1128] s->state = 12292 [L1129] tmp = __VERIFIER_nondet_int() [L1130] cb = (void (*)())((void *)0) [L1131] ret = -1 [L1132] skip = 0 [L1133] EXPR s->info_callback VAL [={0:0}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->info_callback={0:-2147483648}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=0, tmp___2=0] [L1133] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1134] EXPR s->info_callback [L1134] cb = s->info_callback [L1142] EXPR s->in_handshake [L1142] s->in_handshake += 1 [L1143] COND FALSE !(tmp___1 & 12288) VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=0, tmp___2=0] [L1153] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, tmp=7, tmp___1=0, tmp___2=0] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=12292, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=0, tmp___2=0] [L1156] COND TRUE s->state == 12292 [L1259] s->new_session = 1 [L1260] s->state = 4096 [L1261] EXPR s->ctx [L1261] EXPR (s->ctx)->stats.sess_connect_renegotiate [L1261] (s->ctx)->stats.sess_connect_renegotiate += 1 [L1266] s->server = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=0, tmp___2=0] [L1267] COND TRUE (unsigned long )cb != (unsigned long )((void *)0) VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=0, tmp___2=0] [L1272] EXPR s->version VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->version=18, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=0, tmp___2=0] [L1272] COND FALSE !((s->version & 65280) != 768) [L1278] s->type = 4096 [L1279] EXPR s->init_buf VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->init_buf={0:15}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=0, tmp___2=0] [L1279] COND FALSE !((unsigned long )s->init_buf == (unsigned long )((void *)0)) [L1291] tmp___4 = __VERIFIER_nondet_int() [L1292] COND FALSE !(! tmp___4) [L1298] tmp___5 = __VERIFIER_nondet_int() [L1299] COND FALSE !(! tmp___5) [L1305] s->state = 4368 [L1306] EXPR s->ctx [L1306] EXPR (s->ctx)->stats.sess_connect [L1306] (s->ctx)->stats.sess_connect += 1 [L1307] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1153] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=12292, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:-2147483648}, blastFlag=0, buf={0:-1}, init=1, ret=-1, s={-12:0}, s={-12:0}, s->state=4368, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1171] COND TRUE s->state == 4368 [L1311] s->shutdown = 0 [L1312] ret = __VERIFIER_nondet_int() [L1313] COND TRUE blastFlag == 0 [L1314] blastFlag = 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1318] COND FALSE !(ret <= 0) [L1323] s->state = 4384 [L1324] s->init_num = 0 [L1325] EXPR s->bbio [L1325] EXPR s->wbio VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->bbio={0:-17}, s->wbio={0:6}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1325] COND TRUE (unsigned long )s->bbio != (unsigned long )s->wbio [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1153] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4368, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:-2147483648}, blastFlag=1, buf={0:-1}, init=1, ret=17, s={-12:0}, s={-12:0}, s->state=4384, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1177] COND TRUE s->state == 4384 [L1333] ret = __VERIFIER_nondet_int() [L1334] COND TRUE blastFlag == 1 [L1335] blastFlag = 2 VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1339] COND FALSE !(ret <= 0) [L1344] s->hit VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->hit=0, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1344] COND FALSE !(s->hit) [L1347] s->state = 4400 VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1349] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1153] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4384, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:-2147483648}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4400, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1183] COND TRUE s->state == 4400 [L1353] EXPR s->s3 [L1353] EXPR (s->s3)->tmp.new_cipher [L1353] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={0:-2147483648}, ((s->s3)->tmp.new_cipher)->algorithms=4294967339, (s->s3)->tmp.new_cipher={-11:0}, blastFlag=2, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1353] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1356] ret = __VERIFIER_nondet_int() [L1357] COND TRUE blastFlag == 2 [L1358] blastFlag = 3 VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1362] COND FALSE !(ret <= 0) VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1368] s->state = 4416 [L1369] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1153] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4400, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:-2147483648}, blastFlag=3, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4416, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1189] COND TRUE s->state == 4416 [L1373] ret = __VERIFIER_nondet_int() [L1374] COND TRUE blastFlag == 3 [L1375] blastFlag = 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11] [L1379] COND FALSE !(ret <= 0) [L1384] s->state = 4432 [L1385] s->init_num = 0 [L1386] tmp___6 = __VERIFIER_nondet_int() [L1387] COND FALSE !(! tmp___6) VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1153] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4416, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=1, s={-12:0}, s={-12:0}, s->state=4432, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1195] COND TRUE s->state == 4432 [L1396] ret = __VERIFIER_nondet_int() [L1397] COND FALSE !(blastFlag == 5) VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1402] COND FALSE !(ret <= 0) [L1407] s->state = 4448 [L1408] s->init_num = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1627] EXPR s->s3 [L1627] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2147483648}, (s->s3)->tmp.reuse_message=4294967347, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->s3={-9:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1627] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1656] skip = 0 VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1153] COND TRUE 1 VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4432, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1155] EXPR s->state [L1155] state = s->state [L1156] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1156] COND FALSE !(s->state == 12292) [L1159] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1159] COND FALSE !(s->state == 16384) [L1162] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1162] COND FALSE !(s->state == 4096) [L1165] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1165] COND FALSE !(s->state == 20480) [L1168] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1168] COND FALSE !(s->state == 4099) [L1171] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1171] COND FALSE !(s->state == 4368) [L1174] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1174] COND FALSE !(s->state == 4369) [L1177] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1177] COND FALSE !(s->state == 4384) [L1180] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1180] COND FALSE !(s->state == 4385) [L1183] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1183] COND FALSE !(s->state == 4400) [L1186] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1186] COND FALSE !(s->state == 4401) [L1189] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1189] COND FALSE !(s->state == 4416) [L1192] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1192] COND FALSE !(s->state == 4417) [L1195] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1195] COND FALSE !(s->state == 4432) [L1198] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1198] COND FALSE !(s->state == 4433) [L1201] EXPR s->state VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=22, s={-12:0}, s={-12:0}, s->state=4448, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1201] COND TRUE s->state == 4448 [L1412] ret = __VERIFIER_nondet_int() [L1413] COND TRUE blastFlag == 4 VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=-18, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] [L1668] reach_error() VAL [={0:-2147483648}, blastFlag=4, buf={0:-1}, init=1, ret=-18, s={-12:0}, s={-12:0}, skip=0, SSLv3_client_data={4:0}, state=4448, tmp=7, tmp___1=0, tmp___2=0, tmp___4=10, tmp___5=11, tmp___6=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 140 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.1s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 59.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 1847 SdHoareTripleChecker+Valid, 59.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1847 mSDsluCounter, 8644 SdHoareTripleChecker+Invalid, 57.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4735 mSDsCounter, 442 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7340 IncrementalHoareTripleChecker+Invalid, 7806 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 442 mSolverCounterUnsat, 3909 mSDtfsCounter, 7340 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 703 GetRequests, 617 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=14, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 2744 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2513 NumberOfCodeBlocks, 2513 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2624 ConstructedInterpolants, 0 QuantifiedInterpolants, 6317 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3383 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 3077/3159 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-15 00:42:09,198 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...