/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_srvr.blast.03.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 00:42:12,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 00:42:12,755 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 00:42:12,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 00:42:12,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 00:42:12,804 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 00:42:12,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 00:42:12,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 00:42:12,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 00:42:12,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 00:42:12,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 00:42:12,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 00:42:12,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 00:42:12,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 00:42:12,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 00:42:12,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 00:42:12,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 00:42:12,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 00:42:12,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 00:42:12,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 00:42:12,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 00:42:12,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 00:42:12,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 00:42:12,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 00:42:12,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 00:42:12,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 00:42:12,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 00:42:12,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 00:42:12,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 00:42:12,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 00:42:12,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 00:42:12,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 00:42:12,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 00:42:12,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 00:42:12,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 00:42:12,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 00:42:12,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 00:42:12,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 00:42:12,855 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 00:42:12,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 00:42:12,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 00:42:12,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-15 00:42:12,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 00:42:12,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 00:42:12,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 00:42:12,868 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 00:42:12,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 00:42:12,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 00:42:12,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 00:42:12,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 00:42:12,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 00:42:12,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 00:42:12,869 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 00:42:12,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 00:42:12,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 00:42:12,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 00:42:12,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 00:42:12,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 00:42:12,870 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 00:42:12,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 00:42:12,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:42:12,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 00:42:12,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 00:42:12,871 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-15 00:42:12,871 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:42:13,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 00:42:13,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 00:42:13,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 00:42:13,074 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 00:42:13,074 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 00:42:13,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.03.i.cil.c [2022-02-15 00:42:13,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c943c70/cacf87302207416c9624473e9fe7ab1d/FLAGc9a6aa675 [2022-02-15 00:42:13,553 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 00:42:13,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.03.i.cil.c [2022-02-15 00:42:13,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c943c70/cacf87302207416c9624473e9fe7ab1d/FLAGc9a6aa675 [2022-02-15 00:42:13,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c943c70/cacf87302207416c9624473e9fe7ab1d [2022-02-15 00:42:13,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 00:42:13,584 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 00:42:13,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 00:42:13,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 00:42:13,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 00:42:13,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:42:13" (1/1) ... [2022-02-15 00:42:13,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b9edbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:13, skipping insertion in model container [2022-02-15 00:42:13,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:42:13" (1/1) ... [2022-02-15 00:42:13,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 00:42:13,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 00:42:13,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.03.i.cil.c[72493,72506] [2022-02-15 00:42:13,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:42:13,953 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 00:42:14,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.03.i.cil.c[72493,72506] [2022-02-15 00:42:14,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:42:14,044 INFO L208 MainTranslator]: Completed translation [2022-02-15 00:42:14,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14 WrapperNode [2022-02-15 00:42:14,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 00:42:14,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 00:42:14,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 00:42:14,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 00:42:14,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14" (1/1) ... [2022-02-15 00:42:14,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14" (1/1) ... [2022-02-15 00:42:14,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14" (1/1) ... [2022-02-15 00:42:14,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14" (1/1) ... [2022-02-15 00:42:14,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14" (1/1) ... [2022-02-15 00:42:14,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14" (1/1) ... [2022-02-15 00:42:14,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14" (1/1) ... [2022-02-15 00:42:14,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 00:42:14,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 00:42:14,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 00:42:14,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 00:42:14,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14" (1/1) ... [2022-02-15 00:42:14,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:42:14,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:42:14,164 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:42:14,180 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:42:14,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 00:42:14,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 00:42:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 00:42:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-02-15 00:42:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-02-15 00:42:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 00:42:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-02-15 00:42:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-02-15 00:42:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-15 00:42:14,190 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-15 00:42:14,190 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-02-15 00:42:14,191 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 00:42:14,192 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-02-15 00:42:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-15 00:42:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 00:42:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 00:42:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 00:42:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-15 00:42:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-15 00:42:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-15 00:42:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-15 00:42:14,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 00:42:14,360 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 00:42:14,362 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 00:42:16,625 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:42:16,974 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-02-15 00:42:16,974 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-02-15 00:42:16,984 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 00:42:16,994 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 00:42:16,994 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 00:42:16,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:42:16 BoogieIcfgContainer [2022-02-15 00:42:16,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 00:42:16,998 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-15 00:42:16,998 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-15 00:42:16,999 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-15 00:42:17,001 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:42:16" (1/1) ... [2022-02-15 00:42:17,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:42:17 BasicIcfg [2022-02-15 00:42:17,055 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-15 00:42:17,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 00:42:17,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 00:42:17,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 00:42:17,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:42:13" (1/4) ... [2022-02-15 00:42:17,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd459b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:42:17, skipping insertion in model container [2022-02-15 00:42:17,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:42:14" (2/4) ... [2022-02-15 00:42:17,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd459b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:42:17, skipping insertion in model container [2022-02-15 00:42:17,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:42:16" (3/4) ... [2022-02-15 00:42:17,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd459b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:42:17, skipping insertion in model container [2022-02-15 00:42:17,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:42:17" (4/4) ... [2022-02-15 00:42:17,063 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.03.i.cil.cJordan [2022-02-15 00:42:17,067 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-15 00:42:17,068 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 00:42:17,108 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 00:42:17,114 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:42:17,115 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 00:42:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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:42:17,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-15 00:42:17,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:17,137 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, 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:17,138 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:17,141 INFO L85 PathProgramCache]: Analyzing trace with hash 215150606, now seen corresponding path program 1 times [2022-02-15 00:42:17,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:17,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515941741] [2022-02-15 00:42:17,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:17,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:17,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:17,657 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:42:17,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:17,658 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515941741] [2022-02-15 00:42:17,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515941741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:17,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:17,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:17,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705515811] [2022-02-15 00:42:17,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:17,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:17,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:17,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:17,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:17,688 INFO L87 Difference]: Start difference. First operand has 153 states, 145 states have (on average 1.696551724137931) internal successors, (246), 146 states have internal predecessors, (246), 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 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 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:19,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:42:21,264 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:42:23,285 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:42:25,306 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:42:25,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:25,977 INFO L93 Difference]: Finished difference Result 277 states and 458 transitions. [2022-02-15 00:42:25,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:25,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 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 52 [2022-02-15 00:42:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:25,986 INFO L225 Difference]: With dead ends: 277 [2022-02-15 00:42:25,986 INFO L226 Difference]: Without dead ends: 251 [2022-02-15 00:42:25,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:42:25,989 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 140 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 65 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:25,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 433 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 520 Invalid, 3 Unknown, 0 Unchecked, 8.2s Time] [2022-02-15 00:42:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-02-15 00:42:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 180. [2022-02-15 00:42:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 175 states have (on average 1.6057142857142856) internal successors, (281), 175 states have internal predecessors, (281), 3 states have call successors, (3), 3 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:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 285 transitions. [2022-02-15 00:42:26,030 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 285 transitions. Word has length 52 [2022-02-15 00:42:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:26,031 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 285 transitions. [2022-02-15 00:42:26,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (3), 2 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:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 285 transitions. [2022-02-15 00:42:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-15 00:42:26,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:26,032 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, 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:26,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 00:42:26,033 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:26,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:26,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1919316583, now seen corresponding path program 1 times [2022-02-15 00:42:26,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:26,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634838681] [2022-02-15 00:42:26,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:26,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:26,141 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:42:26,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:26,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634838681] [2022-02-15 00:42:26,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634838681] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:26,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:26,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:26,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460590236] [2022-02-15 00:42:26,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:26,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:26,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:26,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:26,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:26,143 INFO L87 Difference]: Start difference. First operand 180 states and 285 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 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:28,152 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:42:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:28,557 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2022-02-15 00:42:28,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:28,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 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 53 [2022-02-15 00:42:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:28,559 INFO L225 Difference]: With dead ends: 208 [2022-02-15 00:42:28,559 INFO L226 Difference]: Without dead ends: 208 [2022-02-15 00:42:28,559 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:42:28,560 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 22 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:28,560 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 451 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 352 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:42:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-15 00:42:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-02-15 00:42:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.6129032258064515) internal successors, (300), 186 states have internal predecessors, (300), 3 states have call successors, (3), 3 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:28,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 304 transitions. [2022-02-15 00:42:28,572 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 304 transitions. Word has length 53 [2022-02-15 00:42:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:28,572 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 304 transitions. [2022-02-15 00:42:28,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (3), 2 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:28,572 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 304 transitions. [2022-02-15 00:42:28,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-15 00:42:28,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:28,575 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:28,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 00:42:28,576 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:28,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:28,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1552626514, now seen corresponding path program 1 times [2022-02-15 00:42:28,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:28,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022399117] [2022-02-15 00:42:28,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:28,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:28,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:28,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022399117] [2022-02-15 00:42:28,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022399117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:28,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:28,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:28,739 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509080379] [2022-02-15 00:42:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:28,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:28,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:28,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:28,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:28,740 INFO L87 Difference]: Start difference. First operand 191 states and 304 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:30,749 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:42:31,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:31,101 INFO L93 Difference]: Finished difference Result 208 states and 324 transitions. [2022-02-15 00:42:31,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:31,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-02-15 00:42:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:31,102 INFO L225 Difference]: With dead ends: 208 [2022-02-15 00:42:31,102 INFO L226 Difference]: Without dead ends: 208 [2022-02-15 00:42:31,103 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:42:31,103 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 24 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:31,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 453 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:42:31,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-15 00:42:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2022-02-15 00:42:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.60752688172043) internal successors, (299), 186 states have internal predecessors, (299), 3 states have call successors, (3), 3 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:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 303 transitions. [2022-02-15 00:42:31,143 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 303 transitions. Word has length 66 [2022-02-15 00:42:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:31,143 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 303 transitions. [2022-02-15 00:42:31,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 303 transitions. [2022-02-15 00:42:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-15 00:42:31,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:31,145 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, 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:31,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 00:42:31,145 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash -867442689, now seen corresponding path program 1 times [2022-02-15 00:42:31,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:31,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968429674] [2022-02-15 00:42:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:31,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:31,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:31,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968429674] [2022-02-15 00:42:31,244 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968429674] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:31,244 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:31,244 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:31,244 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970984979] [2022-02-15 00:42:31,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:31,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:31,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:31,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:31,245 INFO L87 Difference]: Start difference. First operand 191 states and 303 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:42:33,263 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:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:33,724 INFO L93 Difference]: Finished difference Result 304 states and 475 transitions. [2022-02-15 00:42:33,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:33,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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 67 [2022-02-15 00:42:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:33,726 INFO L225 Difference]: With dead ends: 304 [2022-02-15 00:42:33,726 INFO L226 Difference]: Without dead ends: 304 [2022-02-15 00:42:33,726 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:42:33,727 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 142 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:33,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-02-15 00:42:33,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-02-15 00:42:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 202. [2022-02-15 00:42:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.5888324873096447) internal successors, (313), 197 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:42:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 317 transitions. [2022-02-15 00:42:33,734 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 317 transitions. Word has length 67 [2022-02-15 00:42:33,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:33,734 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 317 transitions. [2022-02-15 00:42:33,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:42:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 317 transitions. [2022-02-15 00:42:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-15 00:42:33,735 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:33,735 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:33,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 00:42:33,735 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:33,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:33,736 INFO L85 PathProgramCache]: Analyzing trace with hash 25207775, now seen corresponding path program 1 times [2022-02-15 00:42:33,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:33,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497337751] [2022-02-15 00:42:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:33,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:33,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497337751] [2022-02-15 00:42:33,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497337751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:33,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:33,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:33,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873235278] [2022-02-15 00:42:33,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:33,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:33,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:33,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:33,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:33,861 INFO L87 Difference]: Start difference. First operand 202 states and 317 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:42:35,873 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:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:36,234 INFO L93 Difference]: Finished difference Result 218 states and 336 transitions. [2022-02-15 00:42:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:36,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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 67 [2022-02-15 00:42:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:36,236 INFO L225 Difference]: With dead ends: 218 [2022-02-15 00:42:36,236 INFO L226 Difference]: Without dead ends: 218 [2022-02-15 00:42:36,236 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:42:36,236 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 26 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:36,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 455 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:42:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-02-15 00:42:36,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2022-02-15 00:42:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.583756345177665) internal successors, (312), 197 states have internal predecessors, (312), 3 states have call successors, (3), 3 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:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 316 transitions. [2022-02-15 00:42:36,242 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 316 transitions. Word has length 67 [2022-02-15 00:42:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:36,242 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 316 transitions. [2022-02-15 00:42:36,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:42:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 316 transitions. [2022-02-15 00:42:36,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-15 00:42:36,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:36,243 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:36,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 00:42:36,244 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:36,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:36,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1102004127, now seen corresponding path program 1 times [2022-02-15 00:42:36,244 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:36,244 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361598771] [2022-02-15 00:42:36,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:36,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:36,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:36,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:36,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:36,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361598771] [2022-02-15 00:42:36,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361598771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:36,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:36,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:36,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566239569] [2022-02-15 00:42:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:36,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:36,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:36,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:36,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:36,335 INFO L87 Difference]: Start difference. First operand 202 states and 316 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:42:38,348 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:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:38,730 INFO L93 Difference]: Finished difference Result 216 states and 333 transitions. [2022-02-15 00:42:38,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:38,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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 67 [2022-02-15 00:42:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:38,731 INFO L225 Difference]: With dead ends: 216 [2022-02-15 00:42:38,732 INFO L226 Difference]: Without dead ends: 216 [2022-02-15 00:42:38,732 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:42:38,732 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 20 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:38,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 459 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 344 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:42:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-15 00:42:38,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 202. [2022-02-15 00:42:38,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.5786802030456852) internal successors, (311), 197 states have internal predecessors, (311), 3 states have call successors, (3), 3 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:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 315 transitions. [2022-02-15 00:42:38,738 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 315 transitions. Word has length 67 [2022-02-15 00:42:38,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:38,738 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 315 transitions. [2022-02-15 00:42:38,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:42:38,738 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 315 transitions. [2022-02-15 00:42:38,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-15 00:42:38,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:38,745 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:38,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 00:42:38,745 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:38,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash -525652865, now seen corresponding path program 1 times [2022-02-15 00:42:38,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:38,746 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688956090] [2022-02-15 00:42:38,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:38,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:38,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688956090] [2022-02-15 00:42:38,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688956090] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:38,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:38,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:38,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785387403] [2022-02-15 00:42:38,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:38,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:38,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:38,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:38,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:38,864 INFO L87 Difference]: Start difference. First operand 202 states and 315 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:42:40,880 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:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:41,188 INFO L93 Difference]: Finished difference Result 215 states and 331 transitions. [2022-02-15 00:42:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:41,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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 67 [2022-02-15 00:42:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:41,190 INFO L225 Difference]: With dead ends: 215 [2022-02-15 00:42:41,190 INFO L226 Difference]: Without dead ends: 215 [2022-02-15 00:42:41,190 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:42:41,191 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 18 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:41,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:42:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-02-15 00:42:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 202. [2022-02-15 00:42:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.5736040609137056) internal successors, (310), 197 states have internal predecessors, (310), 3 states have call successors, (3), 3 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:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 314 transitions. [2022-02-15 00:42:41,196 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 314 transitions. Word has length 67 [2022-02-15 00:42:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:41,196 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 314 transitions. [2022-02-15 00:42:41,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 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:42:41,196 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 314 transitions. [2022-02-15 00:42:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-15 00:42:41,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:41,197 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:41,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 00:42:41,197 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:41,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:41,198 INFO L85 PathProgramCache]: Analyzing trace with hash 164619342, now seen corresponding path program 1 times [2022-02-15 00:42:41,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:41,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460748072] [2022-02-15 00:42:41,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:41,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:41,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:41,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460748072] [2022-02-15 00:42:41,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460748072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:41,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:41,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:41,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705284013] [2022-02-15 00:42:41,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:41,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:41,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:41,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:41,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:41,305 INFO L87 Difference]: Start difference. First operand 202 states and 314 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 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:43,320 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:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:43,722 INFO L93 Difference]: Finished difference Result 304 states and 469 transitions. [2022-02-15 00:42:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:43,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 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 68 [2022-02-15 00:42:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:43,724 INFO L225 Difference]: With dead ends: 304 [2022-02-15 00:42:43,724 INFO L226 Difference]: Without dead ends: 304 [2022-02-15 00:42:43,724 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:42:43,725 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:43,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:42:43,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-02-15 00:42:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 204. [2022-02-15 00:42:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.5628140703517588) internal successors, (311), 199 states have internal predecessors, (311), 3 states have call successors, (3), 3 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:43,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 315 transitions. [2022-02-15 00:42:43,729 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 315 transitions. Word has length 68 [2022-02-15 00:42:43,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:43,729 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 315 transitions. [2022-02-15 00:42:43,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 2 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:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 315 transitions. [2022-02-15 00:42:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-02-15 00:42:43,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:43,730 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:43,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 00:42:43,731 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash -770749893, now seen corresponding path program 1 times [2022-02-15 00:42:43,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:43,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827774946] [2022-02-15 00:42:43,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:43,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:43,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:43,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827774946] [2022-02-15 00:42:43,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827774946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:43,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:43,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:43,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351852461] [2022-02-15 00:42:43,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:43,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:43,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:43,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:43,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:43,825 INFO L87 Difference]: Start difference. First operand 204 states and 315 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 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:45,833 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:42:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:46,187 INFO L93 Difference]: Finished difference Result 217 states and 331 transitions. [2022-02-15 00:42:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 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 69 [2022-02-15 00:42:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:46,189 INFO L225 Difference]: With dead ends: 217 [2022-02-15 00:42:46,189 INFO L226 Difference]: Without dead ends: 217 [2022-02-15 00:42:46,189 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:42:46,190 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 20 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:46,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 461 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:42:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-02-15 00:42:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 204. [2022-02-15 00:42:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.5577889447236182) internal successors, (310), 199 states have internal predecessors, (310), 3 states have call successors, (3), 3 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:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 314 transitions. [2022-02-15 00:42:46,194 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 314 transitions. Word has length 69 [2022-02-15 00:42:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:46,194 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 314 transitions. [2022-02-15 00:42:46,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (3), 2 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:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 314 transitions. [2022-02-15 00:42:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-15 00:42:46,195 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:46,195 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:46,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 00:42:46,195 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash -424045493, now seen corresponding path program 1 times [2022-02-15 00:42:46,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:46,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784776266] [2022-02-15 00:42:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:46,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:46,292 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:46,292 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784776266] [2022-02-15 00:42:46,292 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784776266] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:46,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:46,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:46,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109810133] [2022-02-15 00:42:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:46,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:46,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:46,294 INFO L87 Difference]: Start difference. First operand 204 states and 314 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 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:48,303 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:42:48,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:48,599 INFO L93 Difference]: Finished difference Result 207 states and 317 transitions. [2022-02-15 00:42:48,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:48,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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 70 [2022-02-15 00:42:48,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:48,601 INFO L225 Difference]: With dead ends: 207 [2022-02-15 00:42:48,601 INFO L226 Difference]: Without dead ends: 207 [2022-02-15 00:42:48,601 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:42:48,601 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:48,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 475 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:42:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-15 00:42:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2022-02-15 00:42:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 199 states have (on average 1.5527638190954773) internal successors, (309), 199 states have internal predecessors, (309), 3 states have call successors, (3), 3 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:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2022-02-15 00:42:48,605 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 70 [2022-02-15 00:42:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:48,605 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2022-02-15 00:42:48,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 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:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2022-02-15 00:42:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-15 00:42:48,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:48,606 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:48,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 00:42:48,606 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1819950276, now seen corresponding path program 1 times [2022-02-15 00:42:48,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:48,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551566371] [2022-02-15 00:42:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:48,691 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:48,691 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551566371] [2022-02-15 00:42:48,691 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551566371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:48,691 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:48,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:48,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530208307] [2022-02-15 00:42:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:48,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:48,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:48,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:48,692 INFO L87 Difference]: Start difference. First operand 204 states and 313 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 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:50,700 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:42:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:51,018 INFO L93 Difference]: Finished difference Result 246 states and 375 transitions. [2022-02-15 00:42:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:51,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 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 70 [2022-02-15 00:42:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:51,019 INFO L225 Difference]: With dead ends: 246 [2022-02-15 00:42:51,019 INFO L226 Difference]: Without dead ends: 246 [2022-02-15 00:42:51,019 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:51,020 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 32 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:51,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 475 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:42:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-02-15 00:42:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 226. [2022-02-15 00:42:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 221 states have (on average 1.5610859728506787) internal successors, (345), 221 states have internal predecessors, (345), 3 states have call successors, (3), 3 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:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 349 transitions. [2022-02-15 00:42:51,024 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 349 transitions. Word has length 70 [2022-02-15 00:42:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:51,024 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 349 transitions. [2022-02-15 00:42:51,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (3), 2 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:51,024 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 349 transitions. [2022-02-15 00:42:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-15 00:42:51,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:51,025 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:51,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 00:42:51,025 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:51,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:51,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1476270059, now seen corresponding path program 1 times [2022-02-15 00:42:51,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:51,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598020270] [2022-02-15 00:42:51,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:51,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:51,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:51,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598020270] [2022-02-15 00:42:51,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598020270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:51,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:51,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:51,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559476510] [2022-02-15 00:42:51,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:51,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:51,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:51,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:51,111 INFO L87 Difference]: Start difference. First operand 226 states and 349 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:42:53,138 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:42:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:53,626 INFO L93 Difference]: Finished difference Result 369 states and 578 transitions. [2022-02-15 00:42:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:53,626 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 83 [2022-02-15 00:42:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:53,627 INFO L225 Difference]: With dead ends: 369 [2022-02-15 00:42:53,627 INFO L226 Difference]: Without dead ends: 369 [2022-02-15 00:42:53,628 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:53,628 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 136 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:53,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 536 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 575 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-02-15 00:42:53,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-02-15 00:42:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 245. [2022-02-15 00:42:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 240 states have (on average 1.5541666666666667) internal successors, (373), 240 states have internal predecessors, (373), 3 states have call successors, (3), 3 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:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 377 transitions. [2022-02-15 00:42:53,633 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 377 transitions. Word has length 83 [2022-02-15 00:42:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:53,633 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 377 transitions. [2022-02-15 00:42:53,633 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:42:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 377 transitions. [2022-02-15 00:42:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-15 00:42:53,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:53,634 INFO L514 BasicCegarLoop]: trace histogram [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, 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:53,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 00:42:53,634 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:53,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:53,634 INFO L85 PathProgramCache]: Analyzing trace with hash -568278974, now seen corresponding path program 1 times [2022-02-15 00:42:53,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:53,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315249030] [2022-02-15 00:42:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:53,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:53,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:53,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-15 00:42:53,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:53,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315249030] [2022-02-15 00:42:53,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315249030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:53,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:53,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:53,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642503192] [2022-02-15 00:42:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:53,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:53,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:53,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:53,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:53,724 INFO L87 Difference]: Start difference. First operand 245 states and 377 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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:42:55,736 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:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:56,105 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2022-02-15 00:42:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:56,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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 84 [2022-02-15 00:42:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:56,107 INFO L225 Difference]: With dead ends: 257 [2022-02-15 00:42:56,107 INFO L226 Difference]: Without dead ends: 257 [2022-02-15 00:42:56,107 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:56,107 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 20 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:56,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 544 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 383 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:42:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-02-15 00:42:56,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 245. [2022-02-15 00:42:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 240 states have (on average 1.55) internal successors, (372), 240 states have internal predecessors, (372), 3 states have call successors, (3), 3 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:56,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 376 transitions. [2022-02-15 00:42:56,111 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 376 transitions. Word has length 84 [2022-02-15 00:42:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:56,112 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 376 transitions. [2022-02-15 00:42:56,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 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:42:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 376 transitions. [2022-02-15 00:42:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-15 00:42:56,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:56,112 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:56,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 00:42:56,112 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:56,113 INFO L85 PathProgramCache]: Analyzing trace with hash 508517378, now seen corresponding path program 1 times [2022-02-15 00:42:56,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:56,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489860145] [2022-02-15 00:42:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:56,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:56,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:56,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489860145] [2022-02-15 00:42:56,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489860145] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:56,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:56,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:56,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920405960] [2022-02-15 00:42:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:56,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:56,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:56,214 INFO L87 Difference]: Start difference. First operand 245 states and 376 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 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:58,221 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:42:58,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:42:58,627 INFO L93 Difference]: Finished difference Result 342 states and 521 transitions. [2022-02-15 00:42:58,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:42:58,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-02-15 00:42:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:42:58,643 INFO L225 Difference]: With dead ends: 342 [2022-02-15 00:42:58,643 INFO L226 Difference]: Without dead ends: 342 [2022-02-15 00:42:58,643 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:58,643 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 135 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:42:58,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:42:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-15 00:42:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 246. [2022-02-15 00:42:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5394190871369295) internal successors, (371), 241 states have internal predecessors, (371), 3 states have call successors, (3), 3 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:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 375 transitions. [2022-02-15 00:42:58,649 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 375 transitions. Word has length 84 [2022-02-15 00:42:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:42:58,649 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 375 transitions. [2022-02-15 00:42:58,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 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:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 375 transitions. [2022-02-15 00:42:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-15 00:42:58,650 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:42:58,650 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:42:58,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 00:42:58,650 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:42:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:42:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1119139614, now seen corresponding path program 1 times [2022-02-15 00:42:58,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:42:58,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006645099] [2022-02-15 00:42:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:42:58,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:42:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:42:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:42:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:42:58,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:42:58,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006645099] [2022-02-15 00:42:58,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006645099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:42:58,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:42:58,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:42:58,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35045353] [2022-02-15 00:42:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:42:58,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:42:58,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:42:58,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:42:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:42:58,738 INFO L87 Difference]: Start difference. First operand 246 states and 375 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 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:43:00,746 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:43:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:43:01,086 INFO L93 Difference]: Finished difference Result 263 states and 397 transitions. [2022-02-15 00:43:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:43:01,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-02-15 00:43:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:43:01,087 INFO L225 Difference]: With dead ends: 263 [2022-02-15 00:43:01,087 INFO L226 Difference]: Without dead ends: 263 [2022-02-15 00:43:01,088 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:43:01,088 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 33 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:43:01,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 481 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:43:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-02-15 00:43:01,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 246. [2022-02-15 00:43:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5352697095435686) internal successors, (370), 241 states have internal predecessors, (370), 3 states have call successors, (3), 3 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:43:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2022-02-15 00:43:01,092 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 84 [2022-02-15 00:43:01,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:43:01,092 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2022-02-15 00:43:01,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (3), 2 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:43:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2022-02-15 00:43:01,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-02-15 00:43:01,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:43:01,093 INFO L514 BasicCegarLoop]: trace histogram [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, 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:43:01,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 00:43:01,093 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:43:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:43:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 468812048, now seen corresponding path program 1 times [2022-02-15 00:43:01,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:43:01,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278220357] [2022-02-15 00:43:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:43:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:43:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:01,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:43:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:43:01,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:43:01,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278220357] [2022-02-15 00:43:01,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278220357] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:43:01,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:43:01,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:43:01,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324360608] [2022-02-15 00:43:01,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:43:01,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:43:01,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:43:01,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:43:01,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:43:01,183 INFO L87 Difference]: Start difference. First operand 246 states and 374 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 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:43:03,190 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:43:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:43:03,614 INFO L93 Difference]: Finished difference Result 342 states and 516 transitions. [2022-02-15 00:43:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:43:03,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-02-15 00:43:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:43:03,616 INFO L225 Difference]: With dead ends: 342 [2022-02-15 00:43:03,616 INFO L226 Difference]: Without dead ends: 342 [2022-02-15 00:43:03,616 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:43:03,617 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 139 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:43:03,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 316 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:43:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-15 00:43:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 246. [2022-02-15 00:43:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5186721991701244) internal successors, (366), 241 states have internal predecessors, (366), 3 states have call successors, (3), 3 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:43:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 370 transitions. [2022-02-15 00:43:03,621 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 370 transitions. Word has length 85 [2022-02-15 00:43:03,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:43:03,621 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 370 transitions. [2022-02-15 00:43:03,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 1 states have call successors, (3), 2 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:43:03,621 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 370 transitions. [2022-02-15 00:43:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-15 00:43:03,622 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:43:03,622 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:43:03,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 00:43:03,622 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:43:03,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:43:03,623 INFO L85 PathProgramCache]: Analyzing trace with hash 303799028, now seen corresponding path program 1 times [2022-02-15 00:43:03,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:43:03,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733511401] [2022-02-15 00:43:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:43:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:43:03,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:03,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:43:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:43:03,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:43:03,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733511401] [2022-02-15 00:43:03,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733511401] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:43:03,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:43:03,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:43:03,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050132509] [2022-02-15 00:43:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:43:03,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:43:03,721 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:43:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:43:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:43:03,731 INFO L87 Difference]: Start difference. First operand 246 states and 370 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 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:43:05,747 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:43:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:43:06,107 INFO L93 Difference]: Finished difference Result 263 states and 392 transitions. [2022-02-15 00:43:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:43:06,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 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 87 [2022-02-15 00:43:06,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:43:06,108 INFO L225 Difference]: With dead ends: 263 [2022-02-15 00:43:06,108 INFO L226 Difference]: Without dead ends: 263 [2022-02-15 00:43:06,108 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:43:06,109 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 35 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:43:06,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 481 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:43:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-02-15 00:43:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 246. [2022-02-15 00:43:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5145228215767634) internal successors, (365), 241 states have internal predecessors, (365), 3 states have call successors, (3), 3 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:43:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 369 transitions. [2022-02-15 00:43:06,113 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 369 transitions. Word has length 87 [2022-02-15 00:43:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:43:06,113 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 369 transitions. [2022-02-15 00:43:06,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 4 states have internal predecessors, (83), 1 states have call successors, (3), 2 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:43:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 369 transitions. [2022-02-15 00:43:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-15 00:43:06,114 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:43:06,114 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:43:06,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 00:43:06,114 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:43:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:43:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1125671178, now seen corresponding path program 1 times [2022-02-15 00:43:06,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:43:06,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781341714] [2022-02-15 00:43:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:43:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:43:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:06,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:43:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:43:06,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:43:06,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781341714] [2022-02-15 00:43:06,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781341714] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:43:06,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:43:06,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:43:06,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855026621] [2022-02-15 00:43:06,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:43:06,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:43:06,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:43:06,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:43:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:43:06,210 INFO L87 Difference]: Start difference. First operand 246 states and 369 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 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:43:08,218 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:43:08,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:43:08,492 INFO L93 Difference]: Finished difference Result 253 states and 378 transitions. [2022-02-15 00:43:08,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:43:08,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 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 88 [2022-02-15 00:43:08,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:43:08,494 INFO L225 Difference]: With dead ends: 253 [2022-02-15 00:43:08,494 INFO L226 Difference]: Without dead ends: 253 [2022-02-15 00:43:08,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:43:08,494 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 26 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:43:08,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 495 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:43:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-02-15 00:43:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 246. [2022-02-15 00:43:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5103734439834025) internal successors, (364), 241 states have internal predecessors, (364), 3 states have call successors, (3), 3 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:43:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 368 transitions. [2022-02-15 00:43:08,499 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 368 transitions. Word has length 88 [2022-02-15 00:43:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:43:08,499 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 368 transitions. [2022-02-15 00:43:08,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (3), 2 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:43:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 368 transitions. [2022-02-15 00:43:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-15 00:43:08,500 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:43:08,500 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:43:08,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 00:43:08,500 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:43:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:43:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash -139346342, now seen corresponding path program 1 times [2022-02-15 00:43:08,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:43:08,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621917563] [2022-02-15 00:43:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:43:08,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:43:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:43:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 00:43:08,570 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:43:08,570 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621917563] [2022-02-15 00:43:08,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621917563] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:43:08,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:43:08,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:43:08,570 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112057132] [2022-02-15 00:43:08,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:43:08,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:43:08,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:43:08,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:43:08,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:43:08,572 INFO L87 Difference]: Start difference. First operand 246 states and 368 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (3), 2 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:43:11,580 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:43:13,602 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:43:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:43:13,817 INFO L93 Difference]: Finished difference Result 273 states and 403 transitions. [2022-02-15 00:43:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:43:13,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (3), 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 92 [2022-02-15 00:43:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:43:13,819 INFO L225 Difference]: With dead ends: 273 [2022-02-15 00:43:13,819 INFO L226 Difference]: Without dead ends: 273 [2022-02-15 00:43:13,819 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:43:13,819 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:43:13,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 407 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 5.2s Time] [2022-02-15 00:43:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-02-15 00:43:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2022-02-15 00:43:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.4888059701492538) internal successors, (399), 268 states have internal predecessors, (399), 3 states have call successors, (3), 3 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:43:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 403 transitions. [2022-02-15 00:43:13,823 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 403 transitions. Word has length 92 [2022-02-15 00:43:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:43:13,823 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 403 transitions. [2022-02-15 00:43:13,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (3), 2 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:43:13,824 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 403 transitions. [2022-02-15 00:43:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-15 00:43:13,824 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:43:13,824 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:43:13,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 00:43:13,824 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:43:13,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:43:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1044000955, now seen corresponding path program 1 times [2022-02-15 00:43:13,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:43:13,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190595446] [2022-02-15 00:43:13,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:43:13,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:43:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:13,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:43:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-15 00:43:13,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:43:13,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190595446] [2022-02-15 00:43:13,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190595446] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:43:13,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:43:13,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:43:13,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236956476] [2022-02-15 00:43:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:43:13,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:43:13,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:43:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:43:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:43:13,950 INFO L87 Difference]: Start difference. First operand 273 states and 403 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 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:43:15,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:43:17,014 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:43:19,036 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:43:21,055 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:43:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:43:21,453 INFO L93 Difference]: Finished difference Result 370 states and 549 transitions. [2022-02-15 00:43:21,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:43:21,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 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 92 [2022-02-15 00:43:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:43:21,455 INFO L225 Difference]: With dead ends: 370 [2022-02-15 00:43:21,455 INFO L226 Difference]: Without dead ends: 368 [2022-02-15 00:43:21,455 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:43:21,456 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 107 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 60 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:43:21,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 326 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 468 Invalid, 3 Unknown, 0 Unchecked, 7.5s Time] [2022-02-15 00:43:21,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-02-15 00:43:21,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 298. [2022-02-15 00:43:21,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 293 states have (on average 1.52901023890785) internal successors, (448), 293 states have internal predecessors, (448), 3 states have call successors, (3), 3 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:43:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 452 transitions. [2022-02-15 00:43:21,460 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 452 transitions. Word has length 92 [2022-02-15 00:43:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:43:21,461 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 452 transitions. [2022-02-15 00:43:21,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (3), 2 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:43:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 452 transitions. [2022-02-15 00:43:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-15 00:43:21,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:43:21,462 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:43:21,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 00:43:21,462 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:43:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:43:21,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1544253597, now seen corresponding path program 1 times [2022-02-15 00:43:21,462 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:43:21,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789674756] [2022-02-15 00:43:21,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:43:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:43:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:21,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:43:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-15 00:43:21,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:43:21,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789674756] [2022-02-15 00:43:21,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789674756] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:43:21,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:43:21,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:43:21,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137489404] [2022-02-15 00:43:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:43:21,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:43:21,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:43:21,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:43:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:43:21,557 INFO L87 Difference]: Start difference. First operand 298 states and 452 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 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:43:23,565 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:43:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:43:23,937 INFO L93 Difference]: Finished difference Result 390 states and 590 transitions. [2022-02-15 00:43:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:43:23,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 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 120 [2022-02-15 00:43:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:43:23,939 INFO L225 Difference]: With dead ends: 390 [2022-02-15 00:43:23,939 INFO L226 Difference]: Without dead ends: 390 [2022-02-15 00:43:23,939 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:43:23,940 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 82 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:43:23,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 443 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 493 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:43:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-02-15 00:43:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 332. [2022-02-15 00:43:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 327 states have (on average 1.5382262996941896) internal successors, (503), 327 states have internal predecessors, (503), 3 states have call successors, (3), 3 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:43:23,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2022-02-15 00:43:23,944 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 120 [2022-02-15 00:43:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:43:23,945 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2022-02-15 00:43:23,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (3), 2 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:43:23,945 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2022-02-15 00:43:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-15 00:43:23,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:43:23,946 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:43:23,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 00:43:23,946 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:43:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:43:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash 641680450, now seen corresponding path program 1 times [2022-02-15 00:43:23,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:43:23,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472206712] [2022-02-15 00:43:23,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:43:23,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:43:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:24,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:43:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-15 00:43:24,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:43:24,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472206712] [2022-02-15 00:43:24,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472206712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:43:24,041 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:43:24,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:43:24,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353329189] [2022-02-15 00:43:24,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:43:24,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:43:24,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:43:24,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:43:24,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:43:24,042 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 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:43:26,063 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:43:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:43:26,419 INFO L93 Difference]: Finished difference Result 379 states and 574 transitions. [2022-02-15 00:43:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:43:26,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 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 120 [2022-02-15 00:43:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:43:26,421 INFO L225 Difference]: With dead ends: 379 [2022-02-15 00:43:26,421 INFO L226 Difference]: Without dead ends: 379 [2022-02-15 00:43:26,421 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:43:26,421 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 35 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:43:26,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 571 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 447 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:43:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-02-15 00:43:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 356. [2022-02-15 00:43:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 351 states have (on average 1.5384615384615385) internal successors, (540), 351 states have internal predecessors, (540), 3 states have call successors, (3), 3 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:43:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 544 transitions. [2022-02-15 00:43:26,426 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 544 transitions. Word has length 120 [2022-02-15 00:43:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:43:26,426 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 544 transitions. [2022-02-15 00:43:26,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (3), 2 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:43:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 544 transitions. [2022-02-15 00:43:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-02-15 00:43:26,427 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:43:26,427 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:43:26,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 00:43:26,428 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:43:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:43:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1040565510, now seen corresponding path program 1 times [2022-02-15 00:43:26,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:43:26,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103184172] [2022-02-15 00:43:26,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:43:26,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:43:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:26,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:43:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:43:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-02-15 00:43:26,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:43:26,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103184172] [2022-02-15 00:43:26,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103184172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:43:26,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:43:26,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 00:43:26,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817508865] [2022-02-15 00:43:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:43:26,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 00:43:26,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:43:26,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 00:43:26,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-15 00:43:26,763 INFO L87 Difference]: Start difference. First operand 356 states and 544 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 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:43:29,097 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:43:31,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:43:33,149 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:43:35,170 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:43:37,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:43:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:43:37,623 INFO L93 Difference]: Finished difference Result 364 states and 554 transitions. [2022-02-15 00:43:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 00:43:37,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 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 132 [2022-02-15 00:43:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:43:37,625 INFO L225 Difference]: With dead ends: 364 [2022-02-15 00:43:37,625 INFO L226 Difference]: Without dead ends: 356 [2022-02-15 00:43:37,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-15 00:43:37,625 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 7 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:43:37,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 792 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 5 Unknown, 0 Unchecked, 10.8s Time] [2022-02-15 00:43:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-02-15 00:43:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-02-15 00:43:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 351 states have (on average 1.5356125356125356) internal successors, (539), 351 states have internal predecessors, (539), 3 states have call successors, (3), 3 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:43:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 543 transitions. [2022-02-15 00:43:37,630 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 543 transitions. Word has length 132 [2022-02-15 00:43:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:43:37,630 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 543 transitions. [2022-02-15 00:43:37,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (3), 3 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:43:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 543 transitions. [2022-02-15 00:43:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-02-15 00:43:37,630 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:43:37,631 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:43:37,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 00:43:37,631 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:43:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:43:37,631 INFO L85 PathProgramCache]: Analyzing trace with hash 825736357, now seen corresponding path program 1 times [2022-02-15 00:43:37,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:43:37,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657486840] [2022-02-15 00:43:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:43:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:43:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-15 00:43:37,992 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-15 00:43:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-15 00:43:38,216 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-15 00:43:38,216 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-15 00:43:38,217 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 00:43:38,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 00:43:38,221 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:43:38,225 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 00:43:38,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:43:38 BasicIcfg [2022-02-15 00:43:38,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 00:43:38,331 INFO L158 Benchmark]: Toolchain (without parser) took 84746.65ms. Allocated memory was 190.8MB in the beginning and 293.6MB in the end (delta: 102.8MB). Free memory was 133.2MB in the beginning and 112.5MB in the end (delta: 20.7MB). Peak memory consumption was 124.3MB. Max. memory is 8.0GB. [2022-02-15 00:43:38,331 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 00:43:38,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.85ms. Allocated memory was 190.8MB in the beginning and 293.6MB in the end (delta: 102.8MB). Free memory was 133.0MB in the beginning and 243.4MB in the end (delta: -110.4MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-02-15 00:43:38,333 INFO L158 Benchmark]: Boogie Preprocessor took 80.93ms. Allocated memory is still 293.6MB. Free memory was 243.4MB in the beginning and 236.1MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-02-15 00:43:38,333 INFO L158 Benchmark]: RCFGBuilder took 2869.30ms. Allocated memory is still 293.6MB. Free memory was 236.1MB in the beginning and 156.9MB in the end (delta: 79.2MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. [2022-02-15 00:43:38,339 INFO L158 Benchmark]: IcfgTransformer took 57.47ms. Allocated memory is still 293.6MB. Free memory was 156.9MB in the beginning and 151.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-02-15 00:43:38,339 INFO L158 Benchmark]: TraceAbstraction took 81274.47ms. Allocated memory is still 293.6MB. Free memory was 151.2MB in the beginning and 112.5MB in the end (delta: 38.6MB). Peak memory consumption was 39.7MB. Max. memory is 8.0GB. [2022-02-15 00:43:38,340 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.09ms. Allocated memory is still 190.8MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 459.85ms. Allocated memory was 190.8MB in the beginning and 293.6MB in the end (delta: 102.8MB). Free memory was 133.0MB in the beginning and 243.4MB in the end (delta: -110.4MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.93ms. Allocated memory is still 293.6MB. Free memory was 243.4MB in the beginning and 236.1MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2869.30ms. Allocated memory is still 293.6MB. Free memory was 236.1MB in the beginning and 156.9MB in the end (delta: 79.2MB). Peak memory consumption was 78.6MB. Max. memory is 8.0GB. * IcfgTransformer took 57.47ms. Allocated memory is still 293.6MB. Free memory was 156.9MB in the beginning and 151.7MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 81274.47ms. Allocated memory is still 293.6MB. Free memory was 151.2MB in the beginning and 112.5MB in the end (delta: 38.6MB). Peak memory consumption was 39.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1734]: 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 1152. Possible FailurePath: [L1054] static int init = 1; [L1055] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967309, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4:0}] [L1077] SSL *s ; [L1078] int tmp ; [L1082] s = malloc(sizeof(SSL)) [L1083] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1084] s->ctx = malloc(sizeof(SSL_CTX)) [L1085] s->session = malloc(sizeof(SSL_SESSION)) [L1086] s->state = 8464 [L1088] s->info_callback = (void (*) ()) __VERIFIER_nondet_ulong() [L1089] s->options = __VERIFIER_nondet_ulong() [L1090] s->verify_mode = __VERIFIER_nondet_int() [L1091] EXPR s->session [L1091] (s->session)->peer = (struct x509_st*) __VERIFIER_nondet_ulong() [L1092] EXPR s->s3 [L1092] (s->s3)->tmp.cert_request = __VERIFIER_nondet_int() [L1093] EXPR s->s3 [L1093] (s->s3)->tmp.new_cipher = malloc(sizeof(struct ssl_cipher_st)) [L1094] EXPR s->s3 [L1094] EXPR (s->s3)->tmp.new_cipher [L1094] ((s->s3)->tmp.new_cipher)->algorithms = __VERIFIER_nondet_ulong() [L1095] EXPR s->s3 [L1095] EXPR (s->s3)->tmp.new_cipher [L1095] ((s->s3)->tmp.new_cipher)->algo_strength = __VERIFIER_nondet_ulong() [L1096] COND FALSE !(__VERIFIER_nondet_int()) [L1102] s->cert = malloc(sizeof(struct cert_st)) [L1103] EXPR s->cert [L1103] (s->cert)->pkeys[0].privatekey = (struct evp_pkey_st*) __VERIFIER_nondet_ulong() [L1106] CALL ssl3_accept(s) VAL [init=1, s={-4294967296:0}, SSLv3_server_data={4:0}] [L1112] BUF_MEM *buf ; [L1113] unsigned long l ; [L1114] unsigned long Time ; [L1115] unsigned long tmp ; [L1116] void (*cb)() ; [L1117] long num1 ; [L1118] int ret ; [L1119] int new_state ; [L1120] int state ; [L1121] int skip ; [L1122] int got_new_session ; [L1123] int tmp___1 = __VERIFIER_nondet_int() ; [L1124] int tmp___2 = __VERIFIER_nondet_int() ; [L1125] int tmp___3 = __VERIFIER_nondet_int() ; [L1126] int tmp___4 = __VERIFIER_nondet_int() ; [L1127] int tmp___5 = __VERIFIER_nondet_int() ; [L1128] int tmp___6 = __VERIFIER_nondet_int() ; [L1129] int tmp___7 ; [L1130] long tmp___8 = __VERIFIER_nondet_long() ; [L1131] int tmp___9 = __VERIFIER_nondet_int() ; [L1132] int tmp___10 = __VERIFIER_nondet_int() ; [L1133] int blastFlag ; [L1137] blastFlag = 0 [L1138] s->hit=__VERIFIER_nondet_int () [L1139] s->state = 8464 [L1140] tmp = __VERIFIER_nondet_int() [L1141] Time = tmp [L1142] cb = (void (*)())((void *)0) [L1143] ret = -1 [L1144] skip = 0 [L1145] got_new_session = 0 [L1146] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->info_callback={0:-2}, skip=0, SSLv3_server_data={4:0}, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1146] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1147] EXPR s->info_callback [L1147] cb = s->info_callback [L1151] EXPR s->in_handshake [L1151] s->in_handshake += 1 [L1152] COND FALSE !(tmp___1 & 12288) VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] EXPR s->cert VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->cert={-4294967295:0}, skip=0, SSLv3_server_data={4:0}, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1161] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={-4294967296:0}, s={-4294967296:0}, s->state=8464, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND TRUE s->state == 8464 [L1354] s->shutdown = 0 [L1355] ret = __VERIFIER_nondet_int() [L1356] COND TRUE blastFlag == 0 [L1357] blastFlag = 1 VAL [={0:-2}, blastFlag=1, got_new_session=0, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1361] COND FALSE !(ret <= 0) [L1366] got_new_session = 1 [L1367] s->state = 8496 [L1368] s->init_num = 0 VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2}, (s->s3)->tmp.reuse_message=4294967306, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8464, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2}, blastFlag=1, got_new_session=1, init=1, ret=17, s={-4294967296:0}, s={-4294967296:0}, s->state=8496, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND TRUE s->state == 8496 [L1372] ret = __VERIFIER_nondet_int() [L1373] COND TRUE blastFlag == 1 [L1374] blastFlag = 2 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1378] COND FALSE !(ret <= 0) [L1383] s->hit VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->hit=9, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1383] COND TRUE s->hit [L1384] s->state = 8656 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1388] s->init_num = 0 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2}, (s->s3)->tmp.reuse_message=4294967306, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8496, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2}, blastFlag=2, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8656, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND TRUE s->state == 8656 [L1586] EXPR s->session [L1586] EXPR s->s3 [L1586] EXPR (s->s3)->tmp.new_cipher [L1586] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1587] COND FALSE !(! tmp___9) [L1593] ret = __VERIFIER_nondet_int() [L1594] COND TRUE blastFlag == 2 [L1595] blastFlag = 3 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1599] COND FALSE !(ret <= 0) [L1604] s->state = 8672 [L1605] s->init_num = 0 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1606] COND FALSE !(! tmp___10) VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] EXPR s->s3 [L1693] EXPR (s->s3)->tmp.reuse_message VAL [={0:-2}, (s->s3)->tmp.reuse_message=4294967306, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->s3={-4294967293:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1693] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1722] skip = 0 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1167] COND TRUE 1 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8656, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1169] EXPR s->state [L1169] state = s->state [L1170] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1170] COND FALSE !(s->state == 12292) [L1173] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1173] COND FALSE !(s->state == 16384) [L1176] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1176] COND FALSE !(s->state == 8192) [L1179] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1179] COND FALSE !(s->state == 24576) [L1182] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1182] COND FALSE !(s->state == 8195) [L1185] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1185] COND FALSE !(s->state == 8480) [L1188] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1188] COND FALSE !(s->state == 8481) [L1191] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1191] COND FALSE !(s->state == 8482) [L1194] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1194] COND FALSE !(s->state == 8464) [L1197] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1197] COND FALSE !(s->state == 8465) [L1200] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1200] COND FALSE !(s->state == 8466) [L1203] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1203] COND FALSE !(s->state == 8496) [L1206] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1206] COND FALSE !(s->state == 8497) [L1209] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1209] COND FALSE !(s->state == 8512) [L1212] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1212] COND FALSE !(s->state == 8513) [L1215] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1215] COND FALSE !(s->state == 8528) [L1218] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1218] COND FALSE !(s->state == 8529) [L1221] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1221] COND FALSE !(s->state == 8544) [L1224] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1224] COND FALSE !(s->state == 8545) [L1227] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1227] COND FALSE !(s->state == 8560) [L1230] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1230] COND FALSE !(s->state == 8561) [L1233] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1233] COND FALSE !(s->state == 8448) [L1236] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1236] COND FALSE !(s->state == 8576) [L1239] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1239] COND FALSE !(s->state == 8577) [L1242] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1242] COND FALSE !(s->state == 8592) [L1245] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1245] COND FALSE !(s->state == 8593) [L1248] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1248] COND FALSE !(s->state == 8608) [L1251] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1251] COND FALSE !(s->state == 8609) [L1254] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1254] COND FALSE !(s->state == 8640) [L1257] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1257] COND FALSE !(s->state == 8641) [L1260] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1260] COND FALSE !(s->state == 8656) [L1263] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1263] COND FALSE !(s->state == 8657) [L1266] EXPR s->state VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=1, s={-4294967296:0}, s={-4294967296:0}, s->state=8672, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1266] COND TRUE s->state == 8672 [L1615] ret = __VERIFIER_nondet_int() [L1616] COND TRUE blastFlag == 3 VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=0, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] [L1734] reach_error() VAL [={0:-2}, blastFlag=3, got_new_session=1, init=1, ret=0, s={-4294967296:0}, s={-4294967296:0}, skip=0, SSLv3_server_data={4:0}, state=8672, Time=10, tmp=10, tmp___1=1, tmp___10=8, tmp___2=-10, tmp___3=11, tmp___4=0, tmp___5=-11, tmp___6=0, tmp___8=0, tmp___9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 81.1s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 77.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 32 mSolverCounterUnknown, 1364 SdHoareTripleChecker+Valid, 76.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1364 mSDsluCounter, 10463 SdHoareTripleChecker+Invalid, 74.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6492 mSDsCounter, 551 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9290 IncrementalHoareTripleChecker+Invalid, 9873 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 551 mSolverCounterUnsat, 3971 mSDtfsCounter, 9290 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=22, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 906 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1999 NumberOfCodeBlocks, 1999 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1844 ConstructedInterpolants, 0 QuantifiedInterpolants, 5160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 626/626 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:43:38,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...