/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.09.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 00:44:21,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 00:44:21,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 00:44:21,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 00:44:21,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 00:44:21,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 00:44:21,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 00:44:21,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 00:44:21,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 00:44:21,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 00:44:21,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 00:44:21,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 00:44:21,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 00:44:21,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 00:44:21,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 00:44:21,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 00:44:21,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 00:44:21,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 00:44:21,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 00:44:21,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 00:44:21,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 00:44:21,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 00:44:21,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 00:44:21,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 00:44:21,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 00:44:21,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 00:44:21,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 00:44:21,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 00:44:21,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 00:44:21,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 00:44:21,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 00:44:21,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 00:44:21,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 00:44:21,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 00:44:21,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 00:44:21,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 00:44:21,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 00:44:21,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 00:44:21,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 00:44:21,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 00:44:21,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 00:44:21,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-15 00:44:21,589 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 00:44:21,589 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 00:44:21,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 00:44:21,590 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-15 00:44:21,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 00:44:21,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-15 00:44:21,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 00:44:21,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 00:44:21,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 00:44:21,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 00:44:21,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-15 00:44:21,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 00:44:21,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 00:44:21,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 00:44:21,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 00:44:21,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 00:44:21,591 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 00:44:21,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 00:44:21,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:44:21,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 00:44:21,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-15 00:44:21,592 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-15 00:44:21,592 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:44:21,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 00:44:21,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 00:44:21,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 00:44:21,737 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 00:44:21,737 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 00:44:21,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-1.c [2022-02-15 00:44:21,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2af3a025/7b93aa13cb20449c99a1448dace70194/FLAG69250cb12 [2022-02-15 00:44:22,186 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 00:44:22,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl/s3_srvr.blast.09.i.cil-1.c [2022-02-15 00:44:22,205 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2af3a025/7b93aa13cb20449c99a1448dace70194/FLAG69250cb12 [2022-02-15 00:44:22,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2af3a025/7b93aa13cb20449c99a1448dace70194 [2022-02-15 00:44:22,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 00:44:22,220 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-15 00:44:22,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 00:44:22,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 00:44:22,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 00:44:22,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274d455b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22, skipping insertion in model container [2022-02-15 00:44:22,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 00:44:22,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 00:44:22,566 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.09.i.cil-1.c[74369,74382] [2022-02-15 00:44:22,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:44:22,597 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 00:44:22,703 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.09.i.cil-1.c[74369,74382] [2022-02-15 00:44:22,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 00:44:22,724 INFO L208 MainTranslator]: Completed translation [2022-02-15 00:44:22,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22 WrapperNode [2022-02-15 00:44:22,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 00:44:22,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 00:44:22,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 00:44:22,725 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 00:44:22,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,829 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 00:44:22,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 00:44:22,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 00:44:22,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 00:44:22,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22" (1/1) ... [2022-02-15 00:44:22,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 00:44:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:44:22,864 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:44:22,878 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:44:22,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 00:44:22,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 00:44:22,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 00:44:22,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2022-02-15 00:44:22,909 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2022-02-15 00:44:22,909 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 00:44:22,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-02-15 00:44:22,910 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2022-02-15 00:44:22,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-15 00:44:22,910 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-15 00:44:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 00:44:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 00:44:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 00:44:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 00:44:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2022-02-15 00:44:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-15 00:44:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 00:44:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-15 00:44:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 00:44:23,029 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 00:44:23,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 00:44:23,621 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-15 00:44:24,002 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2022-02-15 00:44:24,002 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2022-02-15 00:44:24,014 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 00:44:24,021 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 00:44:24,021 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-15 00:44:24,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:44:24 BoogieIcfgContainer [2022-02-15 00:44:24,023 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 00:44:24,024 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-15 00:44:24,024 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-15 00:44:24,025 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-15 00:44:24,027 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:44:24" (1/1) ... [2022-02-15 00:44:24,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:44:24 BasicIcfg [2022-02-15 00:44:24,075 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-15 00:44:24,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 00:44:24,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 00:44:24,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 00:44:24,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:44:22" (1/4) ... [2022-02-15 00:44:24,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bdf1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:44:24, skipping insertion in model container [2022-02-15 00:44:24,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:44:22" (2/4) ... [2022-02-15 00:44:24,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bdf1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:44:24, skipping insertion in model container [2022-02-15 00:44:24,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:44:24" (3/4) ... [2022-02-15 00:44:24,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14bdf1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:44:24, skipping insertion in model container [2022-02-15 00:44:24,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.02 12:44:24" (4/4) ... [2022-02-15 00:44:24,082 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.cJordan [2022-02-15 00:44:24,085 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-15 00:44:24,086 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 00:44:24,124 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 00:44:24,131 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:44:24,131 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 00:44:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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:44:24,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-15 00:44:24,159 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:44:24,160 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] [2022-02-15 00:44:24,160 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:44:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:44:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1099342272, now seen corresponding path program 1 times [2022-02-15 00:44:24,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:44:24,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347477442] [2022-02-15 00:44:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:44:24,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:44:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:44:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:24,697 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:44:24,697 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:44:24,697 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347477442] [2022-02-15 00:44:24,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347477442] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:44:24,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:44:24,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:44:24,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915313904] [2022-02-15 00:44:24,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:44:24,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:44:24,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:44:24,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:44:24,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:44:24,738 INFO L87 Difference]: Start difference. First operand has 158 states, 150 states have (on average 1.7066666666666668) internal successors, (256), 151 states have internal predecessors, (256), 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 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:26,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:28,852 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:44:30,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:44:31,073 INFO L93 Difference]: Finished difference Result 191 states and 312 transitions. [2022-02-15 00:44:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:44:31,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-02-15 00:44:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:44:31,083 INFO L225 Difference]: With dead ends: 191 [2022-02-15 00:44:31,083 INFO L226 Difference]: Without dead ends: 170 [2022-02-15 00:44:31,083 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:44:31,085 INFO L933 BasicCegarLoop]: 229 mSDtfsCounter, 34 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:44:31,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 607 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 414 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2022-02-15 00:44:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-15 00:44:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2022-02-15 00:44:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.554054054054054) internal successors, (230), 148 states have internal predecessors, (230), 3 states have call successors, (3), 3 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:44:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 234 transitions. [2022-02-15 00:44:31,128 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 234 transitions. Word has length 42 [2022-02-15 00:44:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:44:31,129 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 234 transitions. [2022-02-15 00:44:31,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 234 transitions. [2022-02-15 00:44:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-15 00:44:31,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:44:31,134 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] [2022-02-15 00:44:31,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 00:44:31,134 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:44:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:44:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1972024210, now seen corresponding path program 1 times [2022-02-15 00:44:31,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:44:31,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110552870] [2022-02-15 00:44:31,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:44:31,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:44:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:44:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:31,316 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:44:31,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:44:31,317 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110552870] [2022-02-15 00:44:31,317 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110552870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:44:31,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:44:31,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:44:31,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316245003] [2022-02-15 00:44:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:44:31,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:44:31,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:44:31,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:44:31,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:44:31,327 INFO L87 Difference]: Start difference. First operand 153 states and 234 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (3), 2 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:44:33,375 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:35,394 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:44:36,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:44:37,381 INFO L93 Difference]: Finished difference Result 272 states and 418 transitions. [2022-02-15 00:44:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:44:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (3), 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 55 [2022-02-15 00:44:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:44:37,383 INFO L225 Difference]: With dead ends: 272 [2022-02-15 00:44:37,383 INFO L226 Difference]: Without dead ends: 272 [2022-02-15 00:44:37,383 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:44:37,384 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 147 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:44:37,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 634 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 625 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-02-15 00:44:37,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-02-15 00:44:37,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 169. [2022-02-15 00:44:37,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5548780487804879) internal successors, (255), 164 states have internal predecessors, (255), 3 states have call successors, (3), 3 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:44:37,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 259 transitions. [2022-02-15 00:44:37,394 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 259 transitions. Word has length 55 [2022-02-15 00:44:37,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:44:37,394 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 259 transitions. [2022-02-15 00:44:37,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (3), 2 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:44:37,394 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 259 transitions. [2022-02-15 00:44:37,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-15 00:44:37,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:44:37,396 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] [2022-02-15 00:44:37,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 00:44:37,396 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:44:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:44:37,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1748095558, now seen corresponding path program 1 times [2022-02-15 00:44:37,396 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:44:37,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308127838] [2022-02-15 00:44:37,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:44:37,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:44:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:37,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:44:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:37,530 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:44:37,530 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:44:37,530 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308127838] [2022-02-15 00:44:37,530 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308127838] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:44:37,530 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:44:37,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:44:37,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471485445] [2022-02-15 00:44:37,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:44:37,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:44:37,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:44:37,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:44:37,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:44:37,532 INFO L87 Difference]: Start difference. First operand 169 states and 259 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:38,583 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:44:40,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:42,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:43,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:44:43,045 INFO L93 Difference]: Finished difference Result 185 states and 278 transitions. [2022-02-15 00:44:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:44:43,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-02-15 00:44:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:44:43,046 INFO L225 Difference]: With dead ends: 185 [2022-02-15 00:44:43,047 INFO L226 Difference]: Without dead ends: 185 [2022-02-15 00:44:43,047 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:44:43,047 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 28 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:44:43,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 485 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-02-15 00:44:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-15 00:44:43,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 169. [2022-02-15 00:44:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.548780487804878) internal successors, (254), 164 states have internal predecessors, (254), 3 states have call successors, (3), 3 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:44:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 258 transitions. [2022-02-15 00:44:43,054 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 258 transitions. Word has length 56 [2022-02-15 00:44:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:44:43,054 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 258 transitions. [2022-02-15 00:44:43,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 258 transitions. [2022-02-15 00:44:43,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-15 00:44:43,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:44:43,056 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] [2022-02-15 00:44:43,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 00:44:43,056 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:44:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:44:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1209199142, now seen corresponding path program 1 times [2022-02-15 00:44:43,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:44:43,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261245636] [2022-02-15 00:44:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:44:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:44:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:44:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:43,144 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:44:43,145 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:44:43,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261245636] [2022-02-15 00:44:43,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261245636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:44:43,145 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:44:43,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:44:43,146 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871880642] [2022-02-15 00:44:43,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:44:43,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:44:43,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:44:43,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:44:43,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:44:43,149 INFO L87 Difference]: Start difference. First operand 169 states and 258 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:46,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:48,056 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:44:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:44:48,398 INFO L93 Difference]: Finished difference Result 185 states and 277 transitions. [2022-02-15 00:44:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:44:48,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-02-15 00:44:48,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:44:48,399 INFO L225 Difference]: With dead ends: 185 [2022-02-15 00:44:48,400 INFO L226 Difference]: Without dead ends: 185 [2022-02-15 00:44:48,400 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:44:48,400 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 26 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:44:48,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 485 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 361 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-02-15 00:44:48,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-15 00:44:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 169. [2022-02-15 00:44:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5426829268292683) internal successors, (253), 164 states have internal predecessors, (253), 3 states have call successors, (3), 3 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:44:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 257 transitions. [2022-02-15 00:44:48,406 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 257 transitions. Word has length 56 [2022-02-15 00:44:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:44:48,406 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 257 transitions. [2022-02-15 00:44:48,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 257 transitions. [2022-02-15 00:44:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-15 00:44:48,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:44:48,407 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] [2022-02-15 00:44:48,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 00:44:48,407 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:44:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:44:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1966452198, now seen corresponding path program 1 times [2022-02-15 00:44:48,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:44:48,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592835673] [2022-02-15 00:44:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:44:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:44:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:48,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:44:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:48,498 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:44:48,498 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:44:48,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592835673] [2022-02-15 00:44:48,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592835673] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:44:48,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:44:48,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:44:48,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625511743] [2022-02-15 00:44:48,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:44:48,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:44:48,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:44:48,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:44:48,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:44:48,499 INFO L87 Difference]: Start difference. First operand 169 states and 257 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:50,041 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:44:52,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:52,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:44:52,864 INFO L93 Difference]: Finished difference Result 183 states and 274 transitions. [2022-02-15 00:44:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:44:52,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-02-15 00:44:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:44:52,865 INFO L225 Difference]: With dead ends: 183 [2022-02-15 00:44:52,865 INFO L226 Difference]: Without dead ends: 183 [2022-02-15 00:44:52,866 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:44:52,866 INFO L933 BasicCegarLoop]: 190 mSDtfsCounter, 20 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:44:52,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 489 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-02-15 00:44:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-15 00:44:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2022-02-15 00:44:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.5365853658536586) internal successors, (252), 164 states have internal predecessors, (252), 3 states have call successors, (3), 3 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:44:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 256 transitions. [2022-02-15 00:44:52,870 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 256 transitions. Word has length 56 [2022-02-15 00:44:52,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:44:52,871 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 256 transitions. [2022-02-15 00:44:52,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 256 transitions. [2022-02-15 00:44:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-15 00:44:52,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:44:52,872 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] [2022-02-15 00:44:52,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 00:44:52,872 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:44:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:44:52,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1979822394, now seen corresponding path program 1 times [2022-02-15 00:44:52,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:44:52,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879641129] [2022-02-15 00:44:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:44:52,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:44:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:44:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:53,021 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:44:53,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:44:53,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879641129] [2022-02-15 00:44:53,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879641129] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:44:53,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:44:53,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:44:53,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310834978] [2022-02-15 00:44:53,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:44:53,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:44:53,023 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:44:53,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:44:53,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:44:53,023 INFO L87 Difference]: Start difference. First operand 169 states and 256 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:54,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:56,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:57,641 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:44:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:44:58,077 INFO L93 Difference]: Finished difference Result 287 states and 439 transitions. [2022-02-15 00:44:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:44:58,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-02-15 00:44:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:44:58,079 INFO L225 Difference]: With dead ends: 287 [2022-02-15 00:44:58,079 INFO L226 Difference]: Without dead ends: 287 [2022-02-15 00:44:58,079 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:44:58,080 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 145 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:44:58,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 344 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-02-15 00:44:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-02-15 00:44:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 187. [2022-02-15 00:44:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.543956043956044) internal successors, (281), 182 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:44:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 285 transitions. [2022-02-15 00:44:58,084 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 285 transitions. Word has length 56 [2022-02-15 00:44:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:44:58,084 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 285 transitions. [2022-02-15 00:44:58,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:58,085 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 285 transitions. [2022-02-15 00:44:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-15 00:44:58,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:44:58,085 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] [2022-02-15 00:44:58,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 00:44:58,086 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:44:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:44:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1222198510, now seen corresponding path program 1 times [2022-02-15 00:44:58,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:44:58,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987709786] [2022-02-15 00:44:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:44:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:44:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:58,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:44:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:44:58,202 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:44:58,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:44:58,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987709786] [2022-02-15 00:44:58,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987709786] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:44:58,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:44:58,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:44:58,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618502232] [2022-02-15 00:44:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:44:58,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:44:58,203 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:44:58,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:44:58,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:44:58,204 INFO L87 Difference]: Start difference. First operand 187 states and 285 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:59,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:44:59,978 INFO L93 Difference]: Finished difference Result 287 states and 436 transitions. [2022-02-15 00:44:59,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:44:59,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-02-15 00:44:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:44:59,980 INFO L225 Difference]: With dead ends: 287 [2022-02-15 00:44:59,980 INFO L226 Difference]: Without dead ends: 287 [2022-02-15 00:44:59,980 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:44:59,981 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 149 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:44:59,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 344 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 00:44:59,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-02-15 00:44:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 187. [2022-02-15 00:44:59,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.5274725274725274) internal successors, (278), 182 states have internal predecessors, (278), 3 states have call successors, (3), 3 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:44:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 282 transitions. [2022-02-15 00:44:59,985 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 282 transitions. Word has length 57 [2022-02-15 00:44:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:44:59,986 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 282 transitions. [2022-02-15 00:44:59,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:44:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 282 transitions. [2022-02-15 00:44:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-15 00:44:59,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:44:59,987 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] [2022-02-15 00:44:59,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 00:44:59,987 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:44:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:44:59,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1020945954, now seen corresponding path program 1 times [2022-02-15 00:44:59,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:44:59,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529882086] [2022-02-15 00:44:59,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:44:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:00,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:00,081 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:45:00,081 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:00,081 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529882086] [2022-02-15 00:45:00,081 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529882086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:00,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:00,082 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:00,082 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584216449] [2022-02-15 00:45:00,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:00,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:00,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:00,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:00,083 INFO L87 Difference]: Start difference. First operand 187 states and 282 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:03,346 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:45:05,368 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:45:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:05,773 INFO L93 Difference]: Finished difference Result 200 states and 298 transitions. [2022-02-15 00:45:05,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:05,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-02-15 00:45:05,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:05,774 INFO L225 Difference]: With dead ends: 200 [2022-02-15 00:45:05,774 INFO L226 Difference]: Without dead ends: 200 [2022-02-15 00:45:05,774 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:45:05,775 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 20 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:05,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 491 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 2 Unknown, 0 Unchecked, 5.7s Time] [2022-02-15 00:45:05,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-15 00:45:05,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 187. [2022-02-15 00:45:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.521978021978022) internal successors, (277), 182 states have internal predecessors, (277), 3 states have call successors, (3), 3 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:45:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 281 transitions. [2022-02-15 00:45:05,780 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 281 transitions. Word has length 58 [2022-02-15 00:45:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:05,780 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 281 transitions. [2022-02-15 00:45:05,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 281 transitions. [2022-02-15 00:45:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-15 00:45:05,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:05,781 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] [2022-02-15 00:45:05,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 00:45:05,782 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:05,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1845134763, now seen corresponding path program 1 times [2022-02-15 00:45:05,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:05,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309145452] [2022-02-15 00:45:05,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:05,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:05,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:05,874 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:45:05,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:05,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309145452] [2022-02-15 00:45:05,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309145452] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:05,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:05,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:05,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958009496] [2022-02-15 00:45:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:05,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:05,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:05,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:05,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:05,876 INFO L87 Difference]: Start difference. First operand 187 states and 281 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:09,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:11,129 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:45:11,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:11,446 INFO L93 Difference]: Finished difference Result 190 states and 284 transitions. [2022-02-15 00:45:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:11,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-02-15 00:45:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:11,448 INFO L225 Difference]: With dead ends: 190 [2022-02-15 00:45:11,448 INFO L226 Difference]: Without dead ends: 190 [2022-02-15 00:45:11,448 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:45:11,448 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 11 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:11,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 505 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 341 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-02-15 00:45:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-02-15 00:45:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2022-02-15 00:45:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.5164835164835164) internal successors, (276), 182 states have internal predecessors, (276), 3 states have call successors, (3), 3 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:45:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 280 transitions. [2022-02-15 00:45:11,452 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 280 transitions. Word has length 59 [2022-02-15 00:45:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:11,452 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 280 transitions. [2022-02-15 00:45:11,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 280 transitions. [2022-02-15 00:45:11,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-15 00:45:11,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:11,453 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] [2022-02-15 00:45:11,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 00:45:11,453 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1478412284, now seen corresponding path program 1 times [2022-02-15 00:45:11,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:11,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800093236] [2022-02-15 00:45:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:11,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:11,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:11,551 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:45:11,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:11,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800093236] [2022-02-15 00:45:11,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800093236] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:11,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:11,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:11,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75946914] [2022-02-15 00:45:11,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:11,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:11,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:11,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:11,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:11,552 INFO L87 Difference]: Start difference. First operand 187 states and 280 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:13,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:15,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:16,316 INFO L93 Difference]: Finished difference Result 305 states and 461 transitions. [2022-02-15 00:45:16,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:16,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-02-15 00:45:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:16,317 INFO L225 Difference]: With dead ends: 305 [2022-02-15 00:45:16,317 INFO L226 Difference]: Without dead ends: 305 [2022-02-15 00:45:16,317 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:45:16,318 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 134 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:16,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 344 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-02-15 00:45:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-02-15 00:45:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 215. [2022-02-15 00:45:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 210 states have (on average 1.5380952380952382) internal successors, (323), 210 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 327 transitions. [2022-02-15 00:45:16,322 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 327 transitions. Word has length 59 [2022-02-15 00:45:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:16,322 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 327 transitions. [2022-02-15 00:45:16,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:16,323 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 327 transitions. [2022-02-15 00:45:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-15 00:45:16,323 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:16,323 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] [2022-02-15 00:45:16,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 00:45:16,323 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:16,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash 478953171, now seen corresponding path program 1 times [2022-02-15 00:45:16,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:16,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198219] [2022-02-15 00:45:16,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:16,471 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:45:16,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:16,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198219] [2022-02-15 00:45:16,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198219] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:16,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:16,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:16,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946335852] [2022-02-15 00:45:16,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:16,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:16,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:16,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:16,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:16,472 INFO L87 Difference]: Start difference. First operand 215 states and 327 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 2 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:45:19,089 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:45:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:20,664 INFO L93 Difference]: Finished difference Result 257 states and 388 transitions. [2022-02-15 00:45:20,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:20,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-02-15 00:45:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:20,666 INFO L225 Difference]: With dead ends: 257 [2022-02-15 00:45:20,666 INFO L226 Difference]: Without dead ends: 257 [2022-02-15 00:45:20,666 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:45:20,666 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 31 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:20,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 505 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 395 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-02-15 00:45:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-02-15 00:45:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 237. [2022-02-15 00:45:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.543103448275862) internal successors, (358), 232 states have internal predecessors, (358), 3 states have call successors, (3), 3 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:45:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 362 transitions. [2022-02-15 00:45:20,670 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 362 transitions. Word has length 60 [2022-02-15 00:45:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:20,670 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 362 transitions. [2022-02-15 00:45:20,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (3), 2 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:45:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 362 transitions. [2022-02-15 00:45:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-15 00:45:20,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:20,671 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:45:20,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 00:45:20,671 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:20,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1095309927, now seen corresponding path program 1 times [2022-02-15 00:45:20,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:20,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555105316] [2022-02-15 00:45:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:20,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-15 00:45:20,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:20,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555105316] [2022-02-15 00:45:20,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555105316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:20,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:20,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:20,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642519463] [2022-02-15 00:45:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:20,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:20,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:20,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:20,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:20,760 INFO L87 Difference]: Start difference. First operand 237 states and 362 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 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:45:22,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:24,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:24,457 INFO L93 Difference]: Finished difference Result 250 states and 377 transitions. [2022-02-15 00:45:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:24,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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 74 [2022-02-15 00:45:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:24,459 INFO L225 Difference]: With dead ends: 250 [2022-02-15 00:45:24,459 INFO L226 Difference]: Without dead ends: 250 [2022-02-15 00:45:24,459 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:45:24,459 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 21 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:24,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 576 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-02-15 00:45:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-02-15 00:45:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 237. [2022-02-15 00:45:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.5387931034482758) internal successors, (357), 232 states have internal predecessors, (357), 3 states have call successors, (3), 3 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:45:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 361 transitions. [2022-02-15 00:45:24,465 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 361 transitions. Word has length 74 [2022-02-15 00:45:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:24,466 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 361 transitions. [2022-02-15 00:45:24,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 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:45:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 361 transitions. [2022-02-15 00:45:24,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-15 00:45:24,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:24,466 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] [2022-02-15 00:45:24,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 00:45:24,467 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:24,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:24,467 INFO L85 PathProgramCache]: Analyzing trace with hash 725568825, now seen corresponding path program 1 times [2022-02-15 00:45:24,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:24,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778633754] [2022-02-15 00:45:24,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:24,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:24,549 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:45:24,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:24,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778633754] [2022-02-15 00:45:24,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778633754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:24,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:24,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:24,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149315071] [2022-02-15 00:45:24,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:24,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:24,550 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:24,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:24,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:24,551 INFO L87 Difference]: Start difference. First operand 237 states and 361 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:27,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:29,665 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:45:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:30,015 INFO L93 Difference]: Finished difference Result 255 states and 384 transitions. [2022-02-15 00:45:30,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:30,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-02-15 00:45:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:30,016 INFO L225 Difference]: With dead ends: 255 [2022-02-15 00:45:30,016 INFO L226 Difference]: Without dead ends: 255 [2022-02-15 00:45:30,016 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:45:30,017 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 35 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:30,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 509 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 390 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-02-15 00:45:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-02-15 00:45:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 237. [2022-02-15 00:45:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 232 states have (on average 1.5344827586206897) internal successors, (356), 232 states have internal predecessors, (356), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 360 transitions. [2022-02-15 00:45:30,021 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 360 transitions. Word has length 74 [2022-02-15 00:45:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:30,021 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 360 transitions. [2022-02-15 00:45:30,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:30,021 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 360 transitions. [2022-02-15 00:45:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-15 00:45:30,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:30,021 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:45:30,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 00:45:30,022 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash -409272786, now seen corresponding path program 1 times [2022-02-15 00:45:30,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:30,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258012171] [2022-02-15 00:45:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:30,173 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-15 00:45:30,173 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:30,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258012171] [2022-02-15 00:45:30,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258012171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:30,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:30,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:45:30,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122494374] [2022-02-15 00:45:30,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:30,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:45:30,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:30,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:45:30,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:45:30,175 INFO L87 Difference]: Start difference. First operand 237 states and 360 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:31,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:33,260 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:45:34,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:36,874 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:45:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:37,209 INFO L93 Difference]: Finished difference Result 246 states and 371 transitions. [2022-02-15 00:45:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 00:45:37,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-02-15 00:45:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:37,211 INFO L225 Difference]: With dead ends: 246 [2022-02-15 00:45:37,211 INFO L226 Difference]: Without dead ends: 246 [2022-02-15 00:45:37,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-15 00:45:37,211 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 3 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:37,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 633 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 434 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-02-15 00:45:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-02-15 00:45:37,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-02-15 00:45:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5228215767634854) internal successors, (367), 241 states have internal predecessors, (367), 3 states have call successors, (3), 3 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:45:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 371 transitions. [2022-02-15 00:45:37,216 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 371 transitions. Word has length 75 [2022-02-15 00:45:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:37,216 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 371 transitions. [2022-02-15 00:45:37,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 371 transitions. [2022-02-15 00:45:37,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-15 00:45:37,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:37,216 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] [2022-02-15 00:45:37,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 00:45:37,217 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:37,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:37,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2074107470, now seen corresponding path program 1 times [2022-02-15 00:45:37,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:37,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895164265] [2022-02-15 00:45:37,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:37,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:37,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:37,301 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:45:37,301 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:37,301 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895164265] [2022-02-15 00:45:37,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895164265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:37,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:37,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:37,302 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427448103] [2022-02-15 00:45:37,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:37,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:37,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:37,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:37,302 INFO L87 Difference]: Start difference. First operand 246 states and 371 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:38,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:40,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:41,545 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:45:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:41,869 INFO L93 Difference]: Finished difference Result 273 states and 405 transitions. [2022-02-15 00:45:41,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:41,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-02-15 00:45:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:41,870 INFO L225 Difference]: With dead ends: 273 [2022-02-15 00:45:41,870 INFO L226 Difference]: Without dead ends: 273 [2022-02-15 00:45:41,870 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:45:41,871 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 39 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:41,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 509 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-02-15 00:45:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-02-15 00:45:41,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 246. [2022-02-15 00:45:41,874 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:45:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 370 transitions. [2022-02-15 00:45:41,874 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 370 transitions. Word has length 75 [2022-02-15 00:45:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:41,875 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 370 transitions. [2022-02-15 00:45:41,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 370 transitions. [2022-02-15 00:45:41,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-15 00:45:41,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:41,877 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] [2022-02-15 00:45:41,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 00:45:41,877 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2128965550, now seen corresponding path program 1 times [2022-02-15 00:45:41,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:41,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718455371] [2022-02-15 00:45:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:41,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:41,973 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:45:41,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:41,974 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718455371] [2022-02-15 00:45:41,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718455371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:41,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:41,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:41,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581887424] [2022-02-15 00:45:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:41,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:41,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:41,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:41,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:41,990 INFO L87 Difference]: Start difference. First operand 246 states and 370 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:44,684 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:45:45,927 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:47,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:47,479 INFO L93 Difference]: Finished difference Result 355 states and 531 transitions. [2022-02-15 00:45:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:47,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-02-15 00:45:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:47,480 INFO L225 Difference]: With dead ends: 355 [2022-02-15 00:45:47,480 INFO L226 Difference]: Without dead ends: 355 [2022-02-15 00:45:47,481 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:45:47,481 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 148 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:47,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 344 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 474 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2022-02-15 00:45:47,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-02-15 00:45:47,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 246. [2022-02-15 00:45:47,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.5020746887966805) internal successors, (362), 241 states have internal predecessors, (362), 3 states have call successors, (3), 3 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:45:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 366 transitions. [2022-02-15 00:45:47,496 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 366 transitions. Word has length 77 [2022-02-15 00:45:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:47,496 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 366 transitions. [2022-02-15 00:45:47,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 366 transitions. [2022-02-15 00:45:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-15 00:45:47,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:47,500 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] [2022-02-15 00:45:47,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 00:45:47,500 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1952802305, now seen corresponding path program 1 times [2022-02-15 00:45:47,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:47,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734639311] [2022-02-15 00:45:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:47,639 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:45:47,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:47,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734639311] [2022-02-15 00:45:47,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734639311] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:47,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:47,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:47,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551018010] [2022-02-15 00:45:47,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:47,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:47,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:47,640 INFO L87 Difference]: Start difference. First operand 246 states and 366 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:49,883 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:51,074 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2022-02-15 00:45:51,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:51,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-02-15 00:45:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:51,075 INFO L225 Difference]: With dead ends: 355 [2022-02-15 00:45:51,075 INFO L226 Difference]: Without dead ends: 355 [2022-02-15 00:45:51,076 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:45:51,076 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 146 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:51,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 344 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-02-15 00:45:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-02-15 00:45:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 246. [2022-02-15 00:45:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.4854771784232366) internal successors, (358), 241 states have internal predecessors, (358), 3 states have call successors, (3), 3 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:45:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 362 transitions. [2022-02-15 00:45:51,080 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 362 transitions. Word has length 78 [2022-02-15 00:45:51,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:51,080 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 362 transitions. [2022-02-15 00:45:51,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:45:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 362 transitions. [2022-02-15 00:45:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-15 00:45:51,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:51,081 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] [2022-02-15 00:45:51,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 00:45:51,081 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:51,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2041710414, now seen corresponding path program 1 times [2022-02-15 00:45:51,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:51,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561676035] [2022-02-15 00:45:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:51,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:51,183 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:45:51,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:51,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561676035] [2022-02-15 00:45:51,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561676035] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:51,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:51,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:51,185 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344746879] [2022-02-15 00:45:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:51,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:51,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:51,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:51,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:51,186 INFO L87 Difference]: Start difference. First operand 246 states and 362 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 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:45:53,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:45:55,700 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:45:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:45:56,157 INFO L93 Difference]: Finished difference Result 353 states and 517 transitions. [2022-02-15 00:45:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:45:56,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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 82 [2022-02-15 00:45:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:45:56,159 INFO L225 Difference]: With dead ends: 353 [2022-02-15 00:45:56,159 INFO L226 Difference]: Without dead ends: 353 [2022-02-15 00:45:56,159 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:45:56,159 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 90 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:45:56,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 513 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 526 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2022-02-15 00:45:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-02-15 00:45:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 277. [2022-02-15 00:45:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 272 states have (on average 1.4926470588235294) internal successors, (406), 272 states have internal predecessors, (406), 3 states have call successors, (3), 3 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:45:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 410 transitions. [2022-02-15 00:45:56,163 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 410 transitions. Word has length 82 [2022-02-15 00:45:56,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:45:56,164 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 410 transitions. [2022-02-15 00:45:56,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 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:45:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 410 transitions. [2022-02-15 00:45:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-15 00:45:56,164 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:45:56,164 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] [2022-02-15 00:45:56,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-15 00:45:56,165 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:45:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:45:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1016218415, now seen corresponding path program 1 times [2022-02-15 00:45:56,165 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:45:56,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200731650] [2022-02-15 00:45:56,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:45:56,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:45:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:56,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:45:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:45:56,249 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:45:56,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:45:56,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200731650] [2022-02-15 00:45:56,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200731650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:45:56,249 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:45:56,249 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:45:56,249 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559239614] [2022-02-15 00:45:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:45:56,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:45:56,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:45:56,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:45:56,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:45:56,250 INFO L87 Difference]: Start difference. First operand 277 states and 410 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 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:45:58,816 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:00,835 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:46:02,858 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:46:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:03,281 INFO L93 Difference]: Finished difference Result 335 states and 491 transitions. [2022-02-15 00:46:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:46:03,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 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 82 [2022-02-15 00:46:03,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:03,282 INFO L225 Difference]: With dead ends: 335 [2022-02-15 00:46:03,282 INFO L226 Difference]: Without dead ends: 335 [2022-02-15 00:46:03,283 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:46:03,283 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 37 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:03,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 605 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 467 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-02-15 00:46:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-02-15 00:46:03,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 301. [2022-02-15 00:46:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 296 states have (on average 1.4966216216216217) internal successors, (443), 296 states have internal predecessors, (443), 3 states have call successors, (3), 3 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:46:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 447 transitions. [2022-02-15 00:46:03,287 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 447 transitions. Word has length 82 [2022-02-15 00:46:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:03,287 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 447 transitions. [2022-02-15 00:46:03,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (3), 2 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:46:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 447 transitions. [2022-02-15 00:46:03,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-15 00:46:03,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:03,288 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:46:03,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-15 00:46:03,288 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:03,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:03,289 INFO L85 PathProgramCache]: Analyzing trace with hash -358305085, now seen corresponding path program 1 times [2022-02-15 00:46:03,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:03,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173030856] [2022-02-15 00:46:03,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:03,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:03,387 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-15 00:46:03,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:03,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173030856] [2022-02-15 00:46:03,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173030856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:03,387 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:03,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:46:03,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738262785] [2022-02-15 00:46:03,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:03,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:46:03,388 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:03,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:46:03,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:46:03,388 INFO L87 Difference]: Start difference. First operand 301 states and 447 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:05,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:06,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:08,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:08,015 INFO L93 Difference]: Finished difference Result 400 states and 594 transitions. [2022-02-15 00:46:08,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:46:08,015 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-02-15 00:46:08,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:08,016 INFO L225 Difference]: With dead ends: 400 [2022-02-15 00:46:08,017 INFO L226 Difference]: Without dead ends: 400 [2022-02-15 00:46:08,017 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:46:08,017 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 149 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:08,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 346 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-02-15 00:46:08,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-02-15 00:46:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 301. [2022-02-15 00:46:08,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 296 states have (on average 1.4763513513513513) internal successors, (437), 296 states have internal predecessors, (437), 3 states have call successors, (3), 3 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:46:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 441 transitions. [2022-02-15 00:46:08,021 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 441 transitions. Word has length 87 [2022-02-15 00:46:08,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:08,022 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 441 transitions. [2022-02-15 00:46:08,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:08,022 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 441 transitions. [2022-02-15 00:46:08,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-02-15 00:46:08,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:08,022 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] [2022-02-15 00:46:08,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-15 00:46:08,023 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:08,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash -627016711, now seen corresponding path program 1 times [2022-02-15 00:46:08,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:08,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392758012] [2022-02-15 00:46:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:08,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:08,106 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:46:08,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:08,106 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392758012] [2022-02-15 00:46:08,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392758012] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:08,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:08,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:46:08,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212145862] [2022-02-15 00:46:08,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:08,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:46:08,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:08,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:46:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:46:08,108 INFO L87 Difference]: Start difference. First operand 301 states and 441 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:09,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:11,617 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:46:13,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:13,841 INFO L93 Difference]: Finished difference Result 429 states and 638 transitions. [2022-02-15 00:46:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:46:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-02-15 00:46:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:13,843 INFO L225 Difference]: With dead ends: 429 [2022-02-15 00:46:13,843 INFO L226 Difference]: Without dead ends: 429 [2022-02-15 00:46:13,843 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:46:13,844 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 120 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:13,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 346 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 475 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-02-15 00:46:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-02-15 00:46:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 351. [2022-02-15 00:46:13,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 346 states have (on average 1.5115606936416186) internal successors, (523), 346 states have internal predecessors, (523), 3 states have call successors, (3), 3 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:46:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 527 transitions. [2022-02-15 00:46:13,849 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 527 transitions. Word has length 87 [2022-02-15 00:46:13,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:13,849 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 527 transitions. [2022-02-15 00:46:13,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 527 transitions. [2022-02-15 00:46:13,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-15 00:46:13,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:13,850 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] [2022-02-15 00:46:13,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-15 00:46:13,850 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2038270526, now seen corresponding path program 1 times [2022-02-15 00:46:13,850 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:13,850 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399055730] [2022-02-15 00:46:13,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:13,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:13,933 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:46:13,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:13,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399055730] [2022-02-15 00:46:13,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399055730] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:13,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:13,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:46:13,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514361716] [2022-02-15 00:46:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:13,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:46:13,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:13,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:46:13,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:46:13,935 INFO L87 Difference]: Start difference. First operand 351 states and 527 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:16,651 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:46:18,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:18,547 INFO L93 Difference]: Finished difference Result 411 states and 613 transitions. [2022-02-15 00:46:18,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:46:18,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 88 [2022-02-15 00:46:18,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:18,548 INFO L225 Difference]: With dead ends: 411 [2022-02-15 00:46:18,549 INFO L226 Difference]: Without dead ends: 411 [2022-02-15 00:46:18,549 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:46:18,549 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 71 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:18,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 483 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 496 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-02-15 00:46:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-02-15 00:46:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 362. [2022-02-15 00:46:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.5210084033613445) internal successors, (543), 357 states have internal predecessors, (543), 3 states have call successors, (3), 3 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:46:18,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 547 transitions. [2022-02-15 00:46:18,575 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 547 transitions. Word has length 88 [2022-02-15 00:46:18,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:18,575 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 547 transitions. [2022-02-15 00:46:18,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:18,575 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 547 transitions. [2022-02-15 00:46:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-15 00:46:18,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:18,576 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:46:18,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-15 00:46:18,576 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:18,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash -987048744, now seen corresponding path program 1 times [2022-02-15 00:46:18,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:18,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078061631] [2022-02-15 00:46:18,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:18,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-15 00:46:18,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:18,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078061631] [2022-02-15 00:46:18,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078061631] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:18,667 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:18,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:46:18,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182852061] [2022-02-15 00:46:18,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:18,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:46:18,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:18,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:46:18,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:46:18,669 INFO L87 Difference]: Start difference. First operand 362 states and 547 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:22,706 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:46:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:23,137 INFO L93 Difference]: Finished difference Result 451 states and 675 transitions. [2022-02-15 00:46:23,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:46:23,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-02-15 00:46:23,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:23,139 INFO L225 Difference]: With dead ends: 451 [2022-02-15 00:46:23,139 INFO L226 Difference]: Without dead ends: 451 [2022-02-15 00:46:23,139 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:46:23,140 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 142 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 61 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:23,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 348 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 473 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-02-15 00:46:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-02-15 00:46:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 362. [2022-02-15 00:46:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.5070028011204482) internal successors, (538), 357 states have internal predecessors, (538), 3 states have call successors, (3), 3 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:46:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 542 transitions. [2022-02-15 00:46:23,144 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 542 transitions. Word has length 96 [2022-02-15 00:46:23,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:23,145 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 542 transitions. [2022-02-15 00:46:23,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 542 transitions. [2022-02-15 00:46:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-15 00:46:23,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:23,146 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:46:23,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-15 00:46:23,146 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:23,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:23,146 INFO L85 PathProgramCache]: Analyzing trace with hash 522570383, now seen corresponding path program 1 times [2022-02-15 00:46:23,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:23,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695620522] [2022-02-15 00:46:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:23,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-15 00:46:23,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:23,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695620522] [2022-02-15 00:46:23,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695620522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:23,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:23,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:46:23,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174522266] [2022-02-15 00:46:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:23,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:46:23,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:23,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:46:23,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:46:23,233 INFO L87 Difference]: Start difference. First operand 362 states and 542 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:46:24,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:26,486 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:46:29,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:29,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:29,427 INFO L93 Difference]: Finished difference Result 441 states and 656 transitions. [2022-02-15 00:46:29,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:46:29,428 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 97 [2022-02-15 00:46:29,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:29,429 INFO L225 Difference]: With dead ends: 441 [2022-02-15 00:46:29,429 INFO L226 Difference]: Without dead ends: 441 [2022-02-15 00:46:29,429 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:46:29,430 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 139 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:29,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 368 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-02-15 00:46:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2022-02-15 00:46:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 362. [2022-02-15 00:46:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 3 states have call successors, (3), 3 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:46:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 536 transitions. [2022-02-15 00:46:29,435 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 536 transitions. Word has length 97 [2022-02-15 00:46:29,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:29,435 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 536 transitions. [2022-02-15 00:46:29,435 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:46:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 536 transitions. [2022-02-15 00:46:29,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-15 00:46:29,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:29,451 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:46:29,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-15 00:46:29,451 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash 39070128, now seen corresponding path program 1 times [2022-02-15 00:46:29,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:29,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77575524] [2022-02-15 00:46:29,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:29,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:29,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-15 00:46:29,640 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:29,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77575524] [2022-02-15 00:46:29,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77575524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:29,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:29,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:46:29,641 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109065010] [2022-02-15 00:46:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:29,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:46:29,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:29,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:46:29,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:46:29,642 INFO L87 Difference]: Start difference. First operand 362 states and 536 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 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:46:33,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:46:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:34,124 INFO L93 Difference]: Finished difference Result 399 states and 586 transitions. [2022-02-15 00:46:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:46:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 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 104 [2022-02-15 00:46:34,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:34,125 INFO L225 Difference]: With dead ends: 399 [2022-02-15 00:46:34,125 INFO L226 Difference]: Without dead ends: 399 [2022-02-15 00:46:34,126 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:46:34,126 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 77 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:34,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 515 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 486 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-02-15 00:46:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-02-15 00:46:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 362. [2022-02-15 00:46:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 357 states have (on average 1.4873949579831933) internal successors, (531), 357 states have internal predecessors, (531), 3 states have call successors, (3), 3 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:46:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 535 transitions. [2022-02-15 00:46:34,130 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 535 transitions. Word has length 104 [2022-02-15 00:46:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:34,130 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 535 transitions. [2022-02-15 00:46:34,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 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:46:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 535 transitions. [2022-02-15 00:46:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-15 00:46:34,131 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:34,131 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:46:34,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-15 00:46:34,131 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash 59407503, now seen corresponding path program 1 times [2022-02-15 00:46:34,132 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:34,132 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355532819] [2022-02-15 00:46:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:34,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-02-15 00:46:34,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:34,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355532819] [2022-02-15 00:46:34,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355532819] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:34,285 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:34,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:46:34,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330752798] [2022-02-15 00:46:34,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:34,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:46:34,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:46:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:46:34,286 INFO L87 Difference]: Start difference. First operand 362 states and 535 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:36,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:37,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:38,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:38,055 INFO L93 Difference]: Finished difference Result 693 states and 1026 transitions. [2022-02-15 00:46:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:46:38,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-02-15 00:46:38,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:38,057 INFO L225 Difference]: With dead ends: 693 [2022-02-15 00:46:38,057 INFO L226 Difference]: Without dead ends: 693 [2022-02-15 00:46:38,057 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:46:38,058 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 143 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:38,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 435 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-02-15 00:46:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-02-15 00:46:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2022-02-15 00:46:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 688 states have (on average 1.4854651162790697) internal successors, (1022), 688 states have internal predecessors, (1022), 3 states have call successors, (3), 3 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:46:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1026 transitions. [2022-02-15 00:46:38,065 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1026 transitions. Word has length 104 [2022-02-15 00:46:38,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:38,065 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 1026 transitions. [2022-02-15 00:46:38,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1026 transitions. [2022-02-15 00:46:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-15 00:46:38,066 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:38,066 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:46:38,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-15 00:46:38,067 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1871211602, now seen corresponding path program 1 times [2022-02-15 00:46:38,067 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:38,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815316938] [2022-02-15 00:46:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:38,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:38,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-15 00:46:38,157 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:38,157 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815316938] [2022-02-15 00:46:38,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815316938] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:38,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:38,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:46:38,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068909256] [2022-02-15 00:46:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:38,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:46:38,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:38,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:46:38,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:46:38,159 INFO L87 Difference]: Start difference. First operand 693 states and 1026 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:39,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:41,710 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:46:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:42,465 INFO L93 Difference]: Finished difference Result 720 states and 1061 transitions. [2022-02-15 00:46:42,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:46:42,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-02-15 00:46:42,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:42,468 INFO L225 Difference]: With dead ends: 720 [2022-02-15 00:46:42,468 INFO L226 Difference]: Without dead ends: 720 [2022-02-15 00:46:42,469 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:46:42,469 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:42,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 417 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-02-15 00:46:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2022-02-15 00:46:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2022-02-15 00:46:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 715 states have (on average 1.4783216783216784) internal successors, (1057), 715 states have internal predecessors, (1057), 3 states have call successors, (3), 3 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:46:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1061 transitions. [2022-02-15 00:46:42,477 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1061 transitions. Word has length 104 [2022-02-15 00:46:42,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:42,477 INFO L470 AbstractCegarLoop]: Abstraction has 720 states and 1061 transitions. [2022-02-15 00:46:42,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1061 transitions. [2022-02-15 00:46:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-15 00:46:42,478 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:42,478 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:46:42,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-15 00:46:42,479 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:42,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1451694771, now seen corresponding path program 1 times [2022-02-15 00:46:42,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:42,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604389298] [2022-02-15 00:46:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-02-15 00:46:42,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:42,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604389298] [2022-02-15 00:46:42,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604389298] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:42,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:42,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:46:42,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136193567] [2022-02-15 00:46:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:42,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:46:42,568 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:42,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:46:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:46:42,569 INFO L87 Difference]: Start difference. First operand 720 states and 1061 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 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:46:44,046 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:45,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:47,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:47,551 INFO L93 Difference]: Finished difference Result 722 states and 1063 transitions. [2022-02-15 00:46:47,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:46:47,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 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 104 [2022-02-15 00:46:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:47,553 INFO L225 Difference]: With dead ends: 722 [2022-02-15 00:46:47,553 INFO L226 Difference]: Without dead ends: 722 [2022-02-15 00:46:47,554 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:46:47,554 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 4 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:47,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 396 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-02-15 00:46:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2022-02-15 00:46:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2022-02-15 00:46:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 717 states have (on average 1.4769874476987448) internal successors, (1059), 717 states have internal predecessors, (1059), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1063 transitions. [2022-02-15 00:46:47,561 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1063 transitions. Word has length 104 [2022-02-15 00:46:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:47,561 INFO L470 AbstractCegarLoop]: Abstraction has 722 states and 1063 transitions. [2022-02-15 00:46:47,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 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:46:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1063 transitions. [2022-02-15 00:46:47,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-15 00:46:47,562 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:47,562 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:46:47,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-15 00:46:47,563 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:47,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:47,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2030270456, now seen corresponding path program 1 times [2022-02-15 00:46:47,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:47,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116360686] [2022-02-15 00:46:47,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:47,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:46:47,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:47,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116360686] [2022-02-15 00:46:47,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116360686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:47,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:47,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:46:47,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521848147] [2022-02-15 00:46:47,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:47,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:46:47,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:47,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:46:47,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:46:47,691 INFO L87 Difference]: Start difference. First operand 722 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 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:46:48,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:46:50,845 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:46:52,865 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:46:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:53,123 INFO L93 Difference]: Finished difference Result 1058 states and 1566 transitions. [2022-02-15 00:46:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:46:53,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 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 106 [2022-02-15 00:46:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:53,126 INFO L225 Difference]: With dead ends: 1058 [2022-02-15 00:46:53,126 INFO L226 Difference]: Without dead ends: 1058 [2022-02-15 00:46:53,126 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:46:53,127 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 164 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:53,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 379 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 244 Invalid, 2 Unknown, 0 Unchecked, 5.4s Time] [2022-02-15 00:46:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2022-02-15 00:46:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1056. [2022-02-15 00:46:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 1051 states have (on average 1.4852521408182684) internal successors, (1561), 1051 states have internal predecessors, (1561), 3 states have call successors, (3), 3 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:46:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1565 transitions. [2022-02-15 00:46:53,138 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1565 transitions. Word has length 106 [2022-02-15 00:46:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:53,138 INFO L470 AbstractCegarLoop]: Abstraction has 1056 states and 1565 transitions. [2022-02-15 00:46:53,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (3), 2 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:46:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1565 transitions. [2022-02-15 00:46:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-15 00:46:53,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:53,139 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:46:53,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-15 00:46:53,140 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:53,140 INFO L85 PathProgramCache]: Analyzing trace with hash 538755348, now seen corresponding path program 1 times [2022-02-15 00:46:53,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:53,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196947706] [2022-02-15 00:46:53,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:53,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:46:53,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:53,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196947706] [2022-02-15 00:46:53,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196947706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:53,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:53,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:46:53,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573851931] [2022-02-15 00:46:53,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:53,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:46:53,225 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:53,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:46:53,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:46:53,226 INFO L87 Difference]: Start difference. First operand 1056 states and 1565 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:46:55,023 INFO L93 Difference]: Finished difference Result 1392 states and 2054 transitions. [2022-02-15 00:46:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:46:55,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2022-02-15 00:46:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:46:55,026 INFO L225 Difference]: With dead ends: 1392 [2022-02-15 00:46:55,026 INFO L226 Difference]: Without dead ends: 1392 [2022-02-15 00:46:55,026 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:46:55,027 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 149 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:46:55,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 576 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-15 00:46:55,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2022-02-15 00:46:55,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1390. [2022-02-15 00:46:55,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1385 states have (on average 1.47942238267148) internal successors, (2049), 1385 states have internal predecessors, (2049), 3 states have call successors, (3), 3 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:46:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2053 transitions. [2022-02-15 00:46:55,041 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2053 transitions. Word has length 112 [2022-02-15 00:46:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:46:55,042 INFO L470 AbstractCegarLoop]: Abstraction has 1390 states and 2053 transitions. [2022-02-15 00:46:55,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:46:55,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2053 transitions. [2022-02-15 00:46:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-02-15 00:46:55,043 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:46:55,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:55,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-15 00:46:55,044 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:46:55,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:46:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash 566693233, now seen corresponding path program 1 times [2022-02-15 00:46:55,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:46:55,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827381695] [2022-02-15 00:46:55,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:46:55,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:46:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:46:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:46:55,155 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:46:55,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:46:55,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827381695] [2022-02-15 00:46:55,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827381695] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:46:55,155 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:46:55,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:46:55,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539390607] [2022-02-15 00:46:55,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:46:55,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:46:55,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:46:55,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:46:55,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:46:55,156 INFO L87 Difference]: Start difference. First operand 1390 states and 2053 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:46:58,130 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:47:00,801 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:01,262 INFO L93 Difference]: Finished difference Result 1648 states and 2429 transitions. [2022-02-15 00:47:01,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:01,262 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 129 [2022-02-15 00:47:01,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:01,266 INFO L225 Difference]: With dead ends: 1648 [2022-02-15 00:47:01,266 INFO L226 Difference]: Without dead ends: 1648 [2022-02-15 00:47:01,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:47:01,267 INFO L933 BasicCegarLoop]: 271 mSDtfsCounter, 72 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:01,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 654 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 595 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-02-15 00:47:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2022-02-15 00:47:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1477. [2022-02-15 00:47:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1472 states have (on average 1.481657608695652) internal successors, (2181), 1472 states have internal predecessors, (2181), 3 states have call successors, (3), 3 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:47:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2185 transitions. [2022-02-15 00:47:01,280 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2185 transitions. Word has length 129 [2022-02-15 00:47:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:01,280 INFO L470 AbstractCegarLoop]: Abstraction has 1477 states and 2185 transitions. [2022-02-15 00:47:01,280 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:47:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2185 transitions. [2022-02-15 00:47:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-02-15 00:47:01,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:01,282 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:47:01,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-15 00:47:01,282 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:01,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:01,282 INFO L85 PathProgramCache]: Analyzing trace with hash -224082698, now seen corresponding path program 1 times [2022-02-15 00:47:01,283 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:01,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444552851] [2022-02-15 00:47:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-02-15 00:47:01,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:01,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444552851] [2022-02-15 00:47:01,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444552851] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:01,366 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:01,366 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:47:01,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268742564] [2022-02-15 00:47:01,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:01,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:47:01,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:01,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:47:01,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:47:01,367 INFO L87 Difference]: Start difference. First operand 1477 states and 2185 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 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:47:03,701 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:47:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:04,628 INFO L93 Difference]: Finished difference Result 1842 states and 2726 transitions. [2022-02-15 00:47:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:47:04,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 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 134 [2022-02-15 00:47:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:04,633 INFO L225 Difference]: With dead ends: 1842 [2022-02-15 00:47:04,633 INFO L226 Difference]: Without dead ends: 1842 [2022-02-15 00:47:04,633 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:47:04,633 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 165 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:04,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 378 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 245 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-02-15 00:47:04,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2022-02-15 00:47:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1840. [2022-02-15 00:47:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1835 states have (on average 1.48283378746594) internal successors, (2721), 1835 states have internal predecessors, (2721), 3 states have call successors, (3), 3 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:47:04,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2725 transitions. [2022-02-15 00:47:04,671 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2725 transitions. Word has length 134 [2022-02-15 00:47:04,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:04,671 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2725 transitions. [2022-02-15 00:47:04,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 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:47:04,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2725 transitions. [2022-02-15 00:47:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-02-15 00:47:04,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:04,673 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1] [2022-02-15 00:47:04,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-15 00:47:04,674 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2056958033, now seen corresponding path program 1 times [2022-02-15 00:47:04,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:04,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636122428] [2022-02-15 00:47:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:04,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:04,766 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:04,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:04,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636122428] [2022-02-15 00:47:04,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636122428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:04,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:04,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:04,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199746275] [2022-02-15 00:47:04,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:04,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:04,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:04,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:04,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:04,768 INFO L87 Difference]: Start difference. First operand 1840 states and 2725 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 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:47:06,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:08,770 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:47:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:09,847 INFO L93 Difference]: Finished difference Result 2067 states and 3044 transitions. [2022-02-15 00:47:09,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:09,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 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 151 [2022-02-15 00:47:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:09,852 INFO L225 Difference]: With dead ends: 2067 [2022-02-15 00:47:09,852 INFO L226 Difference]: Without dead ends: 2067 [2022-02-15 00:47:09,852 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:47:09,853 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 87 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:09,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 652 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 594 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2022-02-15 00:47:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-02-15 00:47:09,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1840. [2022-02-15 00:47:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1835 states have (on average 1.4806539509536785) internal successors, (2717), 1835 states have internal predecessors, (2717), 3 states have call successors, (3), 3 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:47:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2721 transitions. [2022-02-15 00:47:09,870 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2721 transitions. Word has length 151 [2022-02-15 00:47:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:09,870 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2721 transitions. [2022-02-15 00:47:09,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 1 states have call successors, (3), 2 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:47:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2721 transitions. [2022-02-15 00:47:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-02-15 00:47:09,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:09,874 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:47:09,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-15 00:47:09,874 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2049187141, now seen corresponding path program 1 times [2022-02-15 00:47:09,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:09,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168463307] [2022-02-15 00:47:09,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:09,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:09,980 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:09,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:09,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168463307] [2022-02-15 00:47:09,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168463307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:09,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:09,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:09,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961708996] [2022-02-15 00:47:09,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:09,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:09,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:09,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:09,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:09,981 INFO L87 Difference]: Start difference. First operand 1840 states and 2721 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 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:47:12,020 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:13,005 INFO L93 Difference]: Finished difference Result 2047 states and 3015 transitions. [2022-02-15 00:47:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:13,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 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 152 [2022-02-15 00:47:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:13,010 INFO L225 Difference]: With dead ends: 2047 [2022-02-15 00:47:13,010 INFO L226 Difference]: Without dead ends: 2047 [2022-02-15 00:47:13,010 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:47:13,010 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 79 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:13,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 640 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-02-15 00:47:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states. [2022-02-15 00:47:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1840. [2022-02-15 00:47:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1835 states have (on average 1.4784741144414169) internal successors, (2713), 1835 states have internal predecessors, (2713), 3 states have call successors, (3), 3 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:47:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2717 transitions. [2022-02-15 00:47:13,027 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2717 transitions. Word has length 152 [2022-02-15 00:47:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:13,027 INFO L470 AbstractCegarLoop]: Abstraction has 1840 states and 2717 transitions. [2022-02-15 00:47:13,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 1 states have call successors, (3), 2 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:47:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2717 transitions. [2022-02-15 00:47:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-02-15 00:47:13,029 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:13,029 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:47:13,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-15 00:47:13,030 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:13,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1005470395, now seen corresponding path program 1 times [2022-02-15 00:47:13,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:13,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352563691] [2022-02-15 00:47:13,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:13,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:13,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:13,117 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:13,117 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:13,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352563691] [2022-02-15 00:47:13,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352563691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:13,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:13,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:13,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069984875] [2022-02-15 00:47:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:13,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:13,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:13,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:13,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:13,118 INFO L87 Difference]: Start difference. First operand 1840 states and 2717 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 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:47:14,515 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:17,281 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:47:19,305 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:47:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:19,747 INFO L93 Difference]: Finished difference Result 2015 states and 2959 transitions. [2022-02-15 00:47:19,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:19,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 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 155 [2022-02-15 00:47:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:19,763 INFO L225 Difference]: With dead ends: 2015 [2022-02-15 00:47:19,764 INFO L226 Difference]: Without dead ends: 2015 [2022-02-15 00:47:19,765 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:47:19,765 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 65 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:19,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 630 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 544 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-02-15 00:47:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2022-02-15 00:47:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1824. [2022-02-15 00:47:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1819 states have (on average 1.4760857614073666) internal successors, (2685), 1819 states have internal predecessors, (2685), 3 states have call successors, (3), 3 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:47:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2689 transitions. [2022-02-15 00:47:19,783 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2689 transitions. Word has length 155 [2022-02-15 00:47:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:19,783 INFO L470 AbstractCegarLoop]: Abstraction has 1824 states and 2689 transitions. [2022-02-15 00:47:19,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 4 states have internal predecessors, (125), 1 states have call successors, (3), 2 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:47:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2689 transitions. [2022-02-15 00:47:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-02-15 00:47:19,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:19,786 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-02-15 00:47:19,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-15 00:47:19,786 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:19,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:19,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1789143693, now seen corresponding path program 1 times [2022-02-15 00:47:19,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:19,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643310325] [2022-02-15 00:47:19,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:19,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:19,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:19,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:19,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643310325] [2022-02-15 00:47:19,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643310325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:19,887 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:19,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:19,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360200578] [2022-02-15 00:47:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:19,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:19,888 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:19,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:19,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:19,888 INFO L87 Difference]: Start difference. First operand 1824 states and 2689 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (3), 2 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:47:20,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:22,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:24,174 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:24,616 INFO L93 Difference]: Finished difference Result 2015 states and 2955 transitions. [2022-02-15 00:47:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:24,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (3), 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 156 [2022-02-15 00:47:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:24,621 INFO L225 Difference]: With dead ends: 2015 [2022-02-15 00:47:24,621 INFO L226 Difference]: Without dead ends: 2015 [2022-02-15 00:47:24,622 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:47:24,623 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 63 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:24,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 628 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-02-15 00:47:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2022-02-15 00:47:24,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1844. [2022-02-15 00:47:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1839 states have (on average 1.475258292550299) internal successors, (2713), 1839 states have internal predecessors, (2713), 3 states have call successors, (3), 3 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:47:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2717 transitions. [2022-02-15 00:47:24,645 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2717 transitions. Word has length 156 [2022-02-15 00:47:24,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:24,645 INFO L470 AbstractCegarLoop]: Abstraction has 1844 states and 2717 transitions. [2022-02-15 00:47:24,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (3), 2 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:47:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2717 transitions. [2022-02-15 00:47:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-02-15 00:47:24,647 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:24,648 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:47:24,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-15 00:47:24,648 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:24,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash -116849752, now seen corresponding path program 1 times [2022-02-15 00:47:24,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:24,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999447245] [2022-02-15 00:47:24,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:24,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:24,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:24,765 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:24,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999447245] [2022-02-15 00:47:24,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999447245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:24,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:24,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:24,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563759881] [2022-02-15 00:47:24,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:24,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:24,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:24,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:24,767 INFO L87 Difference]: Start difference. First operand 1844 states and 2717 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (3), 2 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:47:26,300 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:27,904 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:30,364 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:47:30,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:30,811 INFO L93 Difference]: Finished difference Result 2015 states and 2951 transitions. [2022-02-15 00:47:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:30,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (3), 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 157 [2022-02-15 00:47:30,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:30,817 INFO L225 Difference]: With dead ends: 2015 [2022-02-15 00:47:30,817 INFO L226 Difference]: Without dead ends: 2015 [2022-02-15 00:47:30,817 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:47:30,818 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 66 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:30,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 626 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 543 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2022-02-15 00:47:30,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2022-02-15 00:47:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1844. [2022-02-15 00:47:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1839 states have (on average 1.473083197389886) internal successors, (2709), 1839 states have internal predecessors, (2709), 3 states have call successors, (3), 3 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:47:30,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2713 transitions. [2022-02-15 00:47:30,843 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2713 transitions. Word has length 157 [2022-02-15 00:47:30,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:30,843 INFO L470 AbstractCegarLoop]: Abstraction has 1844 states and 2713 transitions. [2022-02-15 00:47:30,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (3), 2 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:47:30,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2713 transitions. [2022-02-15 00:47:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-02-15 00:47:30,846 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:30,847 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:47:30,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-15 00:47:30,847 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:30,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1499023576, now seen corresponding path program 1 times [2022-02-15 00:47:30,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:30,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715302899] [2022-02-15 00:47:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:30,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:30,953 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:30,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:30,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715302899] [2022-02-15 00:47:30,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715302899] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:30,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:30,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:30,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041648034] [2022-02-15 00:47:30,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:30,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:30,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:30,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:30,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:30,956 INFO L87 Difference]: Start difference. First operand 1844 states and 2713 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (3), 2 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:47:32,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:35,631 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:47:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:37,087 INFO L93 Difference]: Finished difference Result 2231 states and 3262 transitions. [2022-02-15 00:47:37,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:37,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (3), 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 157 [2022-02-15 00:47:37,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:37,091 INFO L225 Difference]: With dead ends: 2231 [2022-02-15 00:47:37,091 INFO L226 Difference]: Without dead ends: 2231 [2022-02-15 00:47:37,091 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:47:37,092 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 118 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:37,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 372 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 464 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2022-02-15 00:47:37,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2022-02-15 00:47:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1859. [2022-02-15 00:47:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1854 states have (on average 1.4692556634304208) internal successors, (2724), 1854 states have internal predecessors, (2724), 3 states have call successors, (3), 3 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:47:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2728 transitions. [2022-02-15 00:47:37,133 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2728 transitions. Word has length 157 [2022-02-15 00:47:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:37,134 INFO L470 AbstractCegarLoop]: Abstraction has 1859 states and 2728 transitions. [2022-02-15 00:47:37,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (3), 2 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:47:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2728 transitions. [2022-02-15 00:47:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-02-15 00:47:37,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:37,139 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-02-15 00:47:37,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-15 00:47:37,144 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1141285446, now seen corresponding path program 1 times [2022-02-15 00:47:37,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:37,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964016247] [2022-02-15 00:47:37,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:37,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:37,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:37,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:37,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964016247] [2022-02-15 00:47:37,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964016247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:37,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:37,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:37,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509401196] [2022-02-15 00:47:37,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:37,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:37,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:37,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:37,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:37,315 INFO L87 Difference]: Start difference. First operand 1859 states and 2728 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (3), 2 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:47:40,015 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:47:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:41,033 INFO L93 Difference]: Finished difference Result 2010 states and 2934 transitions. [2022-02-15 00:47:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:41,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (3), 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 157 [2022-02-15 00:47:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:41,037 INFO L225 Difference]: With dead ends: 2010 [2022-02-15 00:47:41,037 INFO L226 Difference]: Without dead ends: 2010 [2022-02-15 00:47:41,037 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:47:41,037 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 56 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:41,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 618 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 525 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-02-15 00:47:41,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2022-02-15 00:47:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1867. [2022-02-15 00:47:41,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1862 states have (on average 1.4672395273899033) internal successors, (2732), 1862 states have internal predecessors, (2732), 3 states have call successors, (3), 3 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:47:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2736 transitions. [2022-02-15 00:47:41,052 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2736 transitions. Word has length 157 [2022-02-15 00:47:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:41,052 INFO L470 AbstractCegarLoop]: Abstraction has 1867 states and 2736 transitions. [2022-02-15 00:47:41,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (3), 2 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:47:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2736 transitions. [2022-02-15 00:47:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-02-15 00:47:41,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:41,054 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:47:41,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-15 00:47:41,054 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:41,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:41,055 INFO L85 PathProgramCache]: Analyzing trace with hash -890117485, now seen corresponding path program 1 times [2022-02-15 00:47:41,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:41,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910217575] [2022-02-15 00:47:41,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:41,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:41,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:41,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910217575] [2022-02-15 00:47:41,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910217575] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:41,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:41,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:41,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776025701] [2022-02-15 00:47:41,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:41,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:41,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:41,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:41,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:41,182 INFO L87 Difference]: Start difference. First operand 1867 states and 2736 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:47:42,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:44,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:46,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:46,852 INFO L93 Difference]: Finished difference Result 2002 states and 2918 transitions. [2022-02-15 00:47:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:46,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2022-02-15 00:47:46,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:46,855 INFO L225 Difference]: With dead ends: 2002 [2022-02-15 00:47:46,855 INFO L226 Difference]: Without dead ends: 2002 [2022-02-15 00:47:46,855 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:47:46,856 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 59 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:46,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 616 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-02-15 00:47:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2022-02-15 00:47:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1867. [2022-02-15 00:47:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1867 states, 1862 states have (on average 1.4650912996777659) internal successors, (2728), 1862 states have internal predecessors, (2728), 3 states have call successors, (3), 3 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:47:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2732 transitions. [2022-02-15 00:47:46,873 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 2732 transitions. Word has length 158 [2022-02-15 00:47:46,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:46,874 INFO L470 AbstractCegarLoop]: Abstraction has 1867 states and 2732 transitions. [2022-02-15 00:47:46,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:47:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 2732 transitions. [2022-02-15 00:47:46,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-02-15 00:47:46,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:46,876 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-02-15 00:47:46,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-15 00:47:46,876 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1644898489, now seen corresponding path program 1 times [2022-02-15 00:47:46,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:46,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525620813] [2022-02-15 00:47:46,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:46,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:47,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:47,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:47,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525620813] [2022-02-15 00:47:47,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525620813] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:47,026 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:47,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:47,026 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130228518] [2022-02-15 00:47:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:47,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:47,027 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:47,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:47,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:47,027 INFO L87 Difference]: Start difference. First operand 1867 states and 2732 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (3), 2 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:47:49,036 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:47:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:49,352 INFO L93 Difference]: Finished difference Result 2002 states and 2914 transitions. [2022-02-15 00:47:49,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:49,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (3), 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 160 [2022-02-15 00:47:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:49,372 INFO L225 Difference]: With dead ends: 2002 [2022-02-15 00:47:49,372 INFO L226 Difference]: Without dead ends: 2002 [2022-02-15 00:47:49,373 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:47:49,373 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 52 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:49,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 614 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 509 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:47:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2022-02-15 00:47:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1871. [2022-02-15 00:47:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1866 states have (on average 1.4640943193997857) internal successors, (2732), 1866 states have internal predecessors, (2732), 3 states have call successors, (3), 3 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:47:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2736 transitions. [2022-02-15 00:47:49,386 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2736 transitions. Word has length 160 [2022-02-15 00:47:49,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:49,387 INFO L470 AbstractCegarLoop]: Abstraction has 1871 states and 2736 transitions. [2022-02-15 00:47:49,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (3), 2 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:47:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2736 transitions. [2022-02-15 00:47:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-02-15 00:47:49,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:49,389 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-02-15 00:47:49,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-15 00:47:49,390 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash -231774159, now seen corresponding path program 1 times [2022-02-15 00:47:49,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:49,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033311544] [2022-02-15 00:47:49,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:49,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:49,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:49,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:49,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033311544] [2022-02-15 00:47:49,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033311544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:49,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:49,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:49,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004246191] [2022-02-15 00:47:49,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:49,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:49,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:49,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:49,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:49,518 INFO L87 Difference]: Start difference. First operand 1871 states and 2736 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:47:52,326 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:47:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:53,339 INFO L93 Difference]: Finished difference Result 2243 states and 3255 transitions. [2022-02-15 00:47:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:53,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-02-15 00:47:53,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:53,342 INFO L225 Difference]: With dead ends: 2243 [2022-02-15 00:47:53,343 INFO L226 Difference]: Without dead ends: 2243 [2022-02-15 00:47:53,343 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:47:53,343 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 114 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:53,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 368 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 462 Invalid, 1 Unknown, 0 Unchecked, 3.8s Time] [2022-02-15 00:47:53,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2022-02-15 00:47:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 1886. [2022-02-15 00:47:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1886 states, 1881 states have (on average 1.4603934077618288) internal successors, (2747), 1881 states have internal predecessors, (2747), 3 states have call successors, (3), 3 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:47:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2751 transitions. [2022-02-15 00:47:53,358 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2751 transitions. Word has length 161 [2022-02-15 00:47:53,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:53,358 INFO L470 AbstractCegarLoop]: Abstraction has 1886 states and 2751 transitions. [2022-02-15 00:47:53,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:47:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2751 transitions. [2022-02-15 00:47:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-02-15 00:47:53,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:53,362 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-02-15 00:47:53,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-15 00:47:53,362 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:53,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash -242797578, now seen corresponding path program 1 times [2022-02-15 00:47:53,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:53,363 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130991019] [2022-02-15 00:47:53,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:53,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:53,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:53,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130991019] [2022-02-15 00:47:53,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130991019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:53,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:53,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:53,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829803826] [2022-02-15 00:47:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:53,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:53,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:53,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:53,496 INFO L87 Difference]: Start difference. First operand 1886 states and 2751 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:47:56,781 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:47:58,807 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:47:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:47:59,201 INFO L93 Difference]: Finished difference Result 2001 states and 2901 transitions. [2022-02-15 00:47:59,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:47:59,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 161 [2022-02-15 00:47:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:47:59,205 INFO L225 Difference]: With dead ends: 2001 [2022-02-15 00:47:59,205 INFO L226 Difference]: Without dead ends: 2001 [2022-02-15 00:47:59,205 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:47:59,206 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 45 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-02-15 00:47:59,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 604 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 499 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2022-02-15 00:47:59,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2022-02-15 00:47:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1894. [2022-02-15 00:47:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1889 states have (on average 1.4584436209634728) internal successors, (2755), 1889 states have internal predecessors, (2755), 3 states have call successors, (3), 3 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:47:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2759 transitions. [2022-02-15 00:47:59,221 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2759 transitions. Word has length 161 [2022-02-15 00:47:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:47:59,223 INFO L470 AbstractCegarLoop]: Abstraction has 1894 states and 2759 transitions. [2022-02-15 00:47:59,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:47:59,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2759 transitions. [2022-02-15 00:47:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-02-15 00:47:59,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:47:59,226 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-02-15 00:47:59,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-15 00:47:59,226 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:47:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:47:59,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1789542991, now seen corresponding path program 1 times [2022-02-15 00:47:59,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:47:59,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92445834] [2022-02-15 00:47:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:47:59,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:47:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:59,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:47:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:47:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:47:59,321 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:47:59,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92445834] [2022-02-15 00:47:59,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92445834] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:47:59,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:47:59,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:47:59,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803553107] [2022-02-15 00:47:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:47:59,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:47:59,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:47:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:47:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:47:59,322 INFO L87 Difference]: Start difference. First operand 1894 states and 2759 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:01,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:03,453 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:48:05,472 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:48:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:05,930 INFO L93 Difference]: Finished difference Result 1993 states and 2889 transitions. [2022-02-15 00:48:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:48:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-02-15 00:48:05,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:05,933 INFO L225 Difference]: With dead ends: 1993 [2022-02-15 00:48:05,933 INFO L226 Difference]: Without dead ends: 1993 [2022-02-15 00:48:05,933 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:48:05,933 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 42 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:05,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 600 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 492 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-02-15 00:48:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-02-15 00:48:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1898. [2022-02-15 00:48:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1898 states, 1893 states have (on average 1.4574749075541469) internal successors, (2759), 1893 states have internal predecessors, (2759), 3 states have call successors, (3), 3 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:48:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2763 transitions. [2022-02-15 00:48:05,948 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2763 transitions. Word has length 162 [2022-02-15 00:48:05,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:05,948 INFO L470 AbstractCegarLoop]: Abstraction has 1898 states and 2763 transitions. [2022-02-15 00:48:05,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:05,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2763 transitions. [2022-02-15 00:48:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-02-15 00:48:05,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:05,950 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:05,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-15 00:48:05,950 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:05,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:05,950 INFO L85 PathProgramCache]: Analyzing trace with hash 268806909, now seen corresponding path program 1 times [2022-02-15 00:48:05,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:05,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988132385] [2022-02-15 00:48:05,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:05,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:06,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:48:06,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:06,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988132385] [2022-02-15 00:48:06,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988132385] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:06,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:06,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:48:06,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243249011] [2022-02-15 00:48:06,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:06,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:48:06,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:06,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:48:06,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:48:06,057 INFO L87 Difference]: Start difference. First operand 1898 states and 2763 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:07,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:09,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:10,901 INFO L93 Difference]: Finished difference Result 1993 states and 2885 transitions. [2022-02-15 00:48:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:48:10,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 162 [2022-02-15 00:48:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:10,904 INFO L225 Difference]: With dead ends: 1993 [2022-02-15 00:48:10,904 INFO L226 Difference]: Without dead ends: 1993 [2022-02-15 00:48:10,904 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:48:10,905 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 40 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:10,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 598 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-02-15 00:48:10,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2022-02-15 00:48:10,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1902. [2022-02-15 00:48:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1902 states, 1897 states have (on average 1.456510279388508) internal successors, (2763), 1897 states have internal predecessors, (2763), 3 states have call successors, (3), 3 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:48:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2767 transitions. [2022-02-15 00:48:10,918 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 2767 transitions. Word has length 162 [2022-02-15 00:48:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:10,918 INFO L470 AbstractCegarLoop]: Abstraction has 1902 states and 2767 transitions. [2022-02-15 00:48:10,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 2767 transitions. [2022-02-15 00:48:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-02-15 00:48:10,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:10,920 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:10,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-15 00:48:10,921 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash 207567975, now seen corresponding path program 1 times [2022-02-15 00:48:10,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:10,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891857883] [2022-02-15 00:48:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:48:11,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:11,028 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891857883] [2022-02-15 00:48:11,028 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891857883] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:11,028 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:11,028 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:48:11,028 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010861223] [2022-02-15 00:48:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:11,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:48:11,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:11,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:48:11,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:48:11,029 INFO L87 Difference]: Start difference. First operand 1902 states and 2767 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (3), 2 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:48:13,043 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:48:13,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:13,442 INFO L93 Difference]: Finished difference Result 2259 states and 3256 transitions. [2022-02-15 00:48:13,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:48:13,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 163 [2022-02-15 00:48:13,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:13,445 INFO L225 Difference]: With dead ends: 2259 [2022-02-15 00:48:13,445 INFO L226 Difference]: Without dead ends: 2259 [2022-02-15 00:48:13,445 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:48:13,446 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 109 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 56 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:13,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 368 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 459 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:48:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2022-02-15 00:48:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1922. [2022-02-15 00:48:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1917 states have (on average 1.4543557642149192) internal successors, (2788), 1917 states have internal predecessors, (2788), 3 states have call successors, (3), 3 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:48:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2792 transitions. [2022-02-15 00:48:13,460 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2792 transitions. Word has length 163 [2022-02-15 00:48:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:13,461 INFO L470 AbstractCegarLoop]: Abstraction has 1922 states and 2792 transitions. [2022-02-15 00:48:13,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 1 states have call successors, (3), 2 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:48:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2792 transitions. [2022-02-15 00:48:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-02-15 00:48:13,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:13,463 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:13,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-15 00:48:13,463 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1467222768, now seen corresponding path program 1 times [2022-02-15 00:48:13,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:13,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680789828] [2022-02-15 00:48:13,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:13,574 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-02-15 00:48:13,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:13,574 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680789828] [2022-02-15 00:48:13,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680789828] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:13,574 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:13,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:48:13,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514724659] [2022-02-15 00:48:13,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:13,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:48:13,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:13,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:48:13,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:48:13,575 INFO L87 Difference]: Start difference. First operand 1922 states and 2792 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 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:48:14,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:16,607 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:48:18,638 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:48:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:19,073 INFO L93 Difference]: Finished difference Result 2302 states and 3343 transitions. [2022-02-15 00:48:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:48:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 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 171 [2022-02-15 00:48:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:19,077 INFO L225 Difference]: With dead ends: 2302 [2022-02-15 00:48:19,077 INFO L226 Difference]: Without dead ends: 2302 [2022-02-15 00:48:19,077 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:48:19,077 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 145 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:19,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 581 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 427 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-02-15 00:48:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2022-02-15 00:48:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2302. [2022-02-15 00:48:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2302 states, 2297 states have (on average 1.453635176316935) internal successors, (3339), 2297 states have internal predecessors, (3339), 3 states have call successors, (3), 3 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:48:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 3343 transitions. [2022-02-15 00:48:19,095 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 3343 transitions. Word has length 171 [2022-02-15 00:48:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:19,095 INFO L470 AbstractCegarLoop]: Abstraction has 2302 states and 3343 transitions. [2022-02-15 00:48:19,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 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:48:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 3343 transitions. [2022-02-15 00:48:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-02-15 00:48:19,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:19,098 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:19,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-15 00:48:19,098 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:19,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:19,098 INFO L85 PathProgramCache]: Analyzing trace with hash -73974424, now seen corresponding path program 1 times [2022-02-15 00:48:19,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:19,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666202159] [2022-02-15 00:48:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:19,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:19,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-15 00:48:19,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:19,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666202159] [2022-02-15 00:48:19,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666202159] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:19,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:19,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:48:19,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274049758] [2022-02-15 00:48:19,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:19,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:48:19,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:19,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:48:19,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:48:19,191 INFO L87 Difference]: Start difference. First operand 2302 states and 3343 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (3), 2 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:48:21,199 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:48:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:21,602 INFO L93 Difference]: Finished difference Result 2677 states and 3888 transitions. [2022-02-15 00:48:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:48:21,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (3), 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 172 [2022-02-15 00:48:21,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:21,605 INFO L225 Difference]: With dead ends: 2677 [2022-02-15 00:48:21,605 INFO L226 Difference]: Without dead ends: 2677 [2022-02-15 00:48:21,606 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:48:21,612 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 137 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:21,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 574 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 416 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-02-15 00:48:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-02-15 00:48:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2677. [2022-02-15 00:48:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4535928143712575) internal successors, (3884), 2672 states have internal predecessors, (3884), 3 states have call successors, (3), 3 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:48:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3888 transitions. [2022-02-15 00:48:21,633 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3888 transitions. Word has length 172 [2022-02-15 00:48:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:21,633 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3888 transitions. [2022-02-15 00:48:21,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (3), 2 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:48:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3888 transitions. [2022-02-15 00:48:21,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-02-15 00:48:21,636 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:21,636 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:21,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-02-15 00:48:21,636 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash -516462024, now seen corresponding path program 1 times [2022-02-15 00:48:21,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:21,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521315677] [2022-02-15 00:48:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-02-15 00:48:21,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:21,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521315677] [2022-02-15 00:48:21,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521315677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:21,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:21,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:48:21,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400849975] [2022-02-15 00:48:21,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:21,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:48:21,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:21,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:48:21,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:48:21,757 INFO L87 Difference]: Start difference. First operand 2677 states and 3888 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:23,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:25,020 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:48:27,683 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:48:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:28,076 INFO L93 Difference]: Finished difference Result 2831 states and 4094 transitions. [2022-02-15 00:48:28,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:48:28,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 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 180 [2022-02-15 00:48:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:28,080 INFO L225 Difference]: With dead ends: 2831 [2022-02-15 00:48:28,080 INFO L226 Difference]: Without dead ends: 2831 [2022-02-15 00:48:28,080 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:48:28,081 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 41 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:28,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 602 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-02-15 00:48:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2022-02-15 00:48:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2677. [2022-02-15 00:48:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4509730538922156) internal successors, (3877), 2672 states have internal predecessors, (3877), 3 states have call successors, (3), 3 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:48:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3881 transitions. [2022-02-15 00:48:28,102 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3881 transitions. Word has length 180 [2022-02-15 00:48:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:28,102 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3881 transitions. [2022-02-15 00:48:28,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3881 transitions. [2022-02-15 00:48:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-02-15 00:48:28,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:28,105 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:28,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-02-15 00:48:28,105 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:28,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash 664470330, now seen corresponding path program 1 times [2022-02-15 00:48:28,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:28,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801777642] [2022-02-15 00:48:28,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:28,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:28,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-02-15 00:48:28,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:28,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801777642] [2022-02-15 00:48:28,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801777642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:28,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:28,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:48:28,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069077578] [2022-02-15 00:48:28,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:28,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:48:28,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:28,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:48:28,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:48:28,257 INFO L87 Difference]: Start difference. First operand 2677 states and 3881 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:48:31,851 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:48:33,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:33,612 INFO L93 Difference]: Finished difference Result 3144 states and 4500 transitions. [2022-02-15 00:48:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:48:33,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 202 [2022-02-15 00:48:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:33,618 INFO L225 Difference]: With dead ends: 3144 [2022-02-15 00:48:33,618 INFO L226 Difference]: Without dead ends: 3144 [2022-02-15 00:48:33,619 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:48:33,619 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 123 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 52 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:33,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 380 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 470 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2022-02-15 00:48:33,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2022-02-15 00:48:33,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2677. [2022-02-15 00:48:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4431137724550898) internal successors, (3856), 2672 states have internal predecessors, (3856), 3 states have call successors, (3), 3 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:48:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3860 transitions. [2022-02-15 00:48:33,650 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3860 transitions. Word has length 202 [2022-02-15 00:48:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:33,650 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3860 transitions. [2022-02-15 00:48:33,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:48:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3860 transitions. [2022-02-15 00:48:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-02-15 00:48:33,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:33,653 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:33,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-02-15 00:48:33,653 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:33,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1023181626, now seen corresponding path program 1 times [2022-02-15 00:48:33,654 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:33,654 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411609403] [2022-02-15 00:48:33,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:33,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:33,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-02-15 00:48:33,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:33,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411609403] [2022-02-15 00:48:33,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411609403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:33,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:33,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:48:33,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202860811] [2022-02-15 00:48:33,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:33,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:48:33,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:33,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:48:33,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:48:33,761 INFO L87 Difference]: Start difference. First operand 2677 states and 3860 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:48:36,329 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:48:38,355 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:48:40,372 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:48:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:40,887 INFO L93 Difference]: Finished difference Result 3144 states and 4459 transitions. [2022-02-15 00:48:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:48:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 202 [2022-02-15 00:48:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:40,892 INFO L225 Difference]: With dead ends: 3144 [2022-02-15 00:48:40,893 INFO L226 Difference]: Without dead ends: 3144 [2022-02-15 00:48:40,893 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:48:40,894 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 125 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 51 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:40,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 415 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 485 Invalid, 3 Unknown, 0 Unchecked, 7.1s Time] [2022-02-15 00:48:40,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2022-02-15 00:48:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2677. [2022-02-15 00:48:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4277694610778444) internal successors, (3815), 2672 states have internal predecessors, (3815), 3 states have call successors, (3), 3 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:48:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3819 transitions. [2022-02-15 00:48:40,932 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3819 transitions. Word has length 202 [2022-02-15 00:48:40,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:40,932 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3819 transitions. [2022-02-15 00:48:40,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:48:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3819 transitions. [2022-02-15 00:48:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-02-15 00:48:40,935 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:40,936 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:40,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-02-15 00:48:40,936 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:40,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:40,936 INFO L85 PathProgramCache]: Analyzing trace with hash -770439321, now seen corresponding path program 1 times [2022-02-15 00:48:40,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:40,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300281802] [2022-02-15 00:48:40,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-02-15 00:48:41,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:41,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300281802] [2022-02-15 00:48:41,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300281802] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:41,050 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:41,050 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:48:41,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213305202] [2022-02-15 00:48:41,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:41,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:48:41,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:48:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:48:41,052 INFO L87 Difference]: Start difference. First operand 2677 states and 3819 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:42,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:45,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:46,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:46,389 INFO L93 Difference]: Finished difference Result 2803 states and 3989 transitions. [2022-02-15 00:48:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:48:46,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 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 203 [2022-02-15 00:48:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:46,392 INFO L225 Difference]: With dead ends: 2803 [2022-02-15 00:48:46,393 INFO L226 Difference]: Without dead ends: 2803 [2022-02-15 00:48:46,393 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:48:46,394 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 39 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:46,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 591 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-02-15 00:48:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2022-02-15 00:48:46,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2677. [2022-02-15 00:48:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4251497005988023) internal successors, (3808), 2672 states have internal predecessors, (3808), 3 states have call successors, (3), 3 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:48:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3812 transitions. [2022-02-15 00:48:46,431 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3812 transitions. Word has length 203 [2022-02-15 00:48:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:46,431 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3812 transitions. [2022-02-15 00:48:46,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3812 transitions. [2022-02-15 00:48:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-02-15 00:48:46,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:46,435 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:46,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-02-15 00:48:46,435 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash 926528038, now seen corresponding path program 1 times [2022-02-15 00:48:46,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:46,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714432719] [2022-02-15 00:48:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:46,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-02-15 00:48:46,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:46,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714432719] [2022-02-15 00:48:46,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714432719] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:46,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:46,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:48:46,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282184527] [2022-02-15 00:48:46,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:46,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:48:46,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:46,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:48:46,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:48:46,597 INFO L87 Difference]: Start difference. First operand 2677 states and 3812 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:47,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:50,003 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:48:52,028 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:48:54,044 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:48:54,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:48:54,503 INFO L93 Difference]: Finished difference Result 3144 states and 4424 transitions. [2022-02-15 00:48:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:48:54,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 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 203 [2022-02-15 00:48:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:48:54,506 INFO L225 Difference]: With dead ends: 3144 [2022-02-15 00:48:54,506 INFO L226 Difference]: Without dead ends: 3144 [2022-02-15 00:48:54,506 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:48:54,507 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 122 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 55 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:48:54,507 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 368 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 460 Invalid, 3 Unknown, 0 Unchecked, 7.9s Time] [2022-02-15 00:48:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2022-02-15 00:48:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2677. [2022-02-15 00:48:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2672 states have (on average 1.4146706586826348) internal successors, (3780), 2672 states have internal predecessors, (3780), 3 states have call successors, (3), 3 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:48:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3784 transitions. [2022-02-15 00:48:54,533 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3784 transitions. Word has length 203 [2022-02-15 00:48:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:48:54,534 INFO L470 AbstractCegarLoop]: Abstraction has 2677 states and 3784 transitions. [2022-02-15 00:48:54,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (3), 2 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:48:54,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3784 transitions. [2022-02-15 00:48:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-02-15 00:48:54,538 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:48:54,539 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:48:54,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-02-15 00:48:54,539 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:48:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:48:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash -806903239, now seen corresponding path program 1 times [2022-02-15 00:48:54,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:48:54,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029217842] [2022-02-15 00:48:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:48:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:48:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:54,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:48:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:48:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-02-15 00:48:54,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:48:54,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029217842] [2022-02-15 00:48:54,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029217842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:48:54,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:48:54,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 00:48:54,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152001800] [2022-02-15 00:48:54,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:48:54,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:48:54,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:48:54,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:48:54,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 00:48:54,686 INFO L87 Difference]: Start difference. First operand 2677 states and 3784 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 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:48:55,944 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:48:58,597 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:49:00,627 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:49:01,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:49:01,055 INFO L93 Difference]: Finished difference Result 3021 states and 4263 transitions. [2022-02-15 00:49:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:49:01,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 205 [2022-02-15 00:49:01,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:49:01,058 INFO L225 Difference]: With dead ends: 3021 [2022-02-15 00:49:01,058 INFO L226 Difference]: Without dead ends: 3021 [2022-02-15 00:49:01,059 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:49:01,059 INFO L933 BasicCegarLoop]: 239 mSDtfsCounter, 34 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:49:01,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 591 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 477 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-02-15 00:49:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2022-02-15 00:49:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2887. [2022-02-15 00:49:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2887 states, 2882 states have (on average 1.4136016655100625) internal successors, (4074), 2882 states have internal predecessors, (4074), 3 states have call successors, (3), 3 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:49:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2887 states to 2887 states and 4078 transitions. [2022-02-15 00:49:01,083 INFO L78 Accepts]: Start accepts. Automaton has 2887 states and 4078 transitions. Word has length 205 [2022-02-15 00:49:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:49:01,083 INFO L470 AbstractCegarLoop]: Abstraction has 2887 states and 4078 transitions. [2022-02-15 00:49:01,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 1 states have call successors, (3), 2 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:49:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2887 states and 4078 transitions. [2022-02-15 00:49:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-02-15 00:49:01,086 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:49:01,087 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:49:01,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-02-15 00:49:01,087 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:49:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:49:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash -737010179, now seen corresponding path program 1 times [2022-02-15 00:49:01,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:49:01,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851583] [2022-02-15 00:49:01,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:49:01,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:49:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:01,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:49:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-02-15 00:49:01,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:49:01,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851583] [2022-02-15 00:49:01,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:49:01,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:49:01,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 00:49:01,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073773192] [2022-02-15 00:49:01,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:49:01,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 00:49:01,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:49:01,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 00:49:01,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-15 00:49:01,376 INFO L87 Difference]: Start difference. First operand 2887 states and 4078 transitions. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 6 states have internal predecessors, (143), 1 states have call successors, (3), 2 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:49:03,384 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:49:03,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:49:03,914 INFO L93 Difference]: Finished difference Result 3372 states and 4729 transitions. [2022-02-15 00:49:03,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:49:03,915 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 6 states have internal predecessors, (143), 1 states have call successors, (3), 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 211 [2022-02-15 00:49:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:49:03,918 INFO L225 Difference]: With dead ends: 3372 [2022-02-15 00:49:03,918 INFO L226 Difference]: Without dead ends: 3372 [2022-02-15 00:49:03,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:49:03,919 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 275 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 110 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:49:03,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 477 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 533 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-02-15 00:49:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2022-02-15 00:49:03,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 2940. [2022-02-15 00:49:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2940 states, 2935 states have (on average 1.415672913117547) internal successors, (4155), 2935 states have internal predecessors, (4155), 3 states have call successors, (3), 3 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:49:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2940 states and 4159 transitions. [2022-02-15 00:49:03,949 INFO L78 Accepts]: Start accepts. Automaton has 2940 states and 4159 transitions. Word has length 211 [2022-02-15 00:49:03,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:49:03,949 INFO L470 AbstractCegarLoop]: Abstraction has 2940 states and 4159 transitions. [2022-02-15 00:49:03,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 6 states have internal predecessors, (143), 1 states have call successors, (3), 2 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:49:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 4159 transitions. [2022-02-15 00:49:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-02-15 00:49:03,952 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:49:03,953 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:49:03,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-02-15 00:49:03,953 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:49:03,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:49:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash 65109109, now seen corresponding path program 1 times [2022-02-15 00:49:03,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:49:03,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605532577] [2022-02-15 00:49:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:49:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:49:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:49:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:04,195 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-02-15 00:49:04,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:49:04,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605532577] [2022-02-15 00:49:04,195 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605532577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:49:04,195 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:49:04,195 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:49:04,195 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747858583] [2022-02-15 00:49:04,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:49:04,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:49:04,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:49:04,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:49:04,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:49:04,196 INFO L87 Difference]: Start difference. First operand 2940 states and 4159 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 2 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:49:05,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:07,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:09,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:10,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:12,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:13,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:49:13,528 INFO L93 Difference]: Finished difference Result 4002 states and 5583 transitions. [2022-02-15 00:49:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 00:49:13,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 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 212 [2022-02-15 00:49:13,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:49:13,534 INFO L225 Difference]: With dead ends: 4002 [2022-02-15 00:49:13,534 INFO L226 Difference]: Without dead ends: 4002 [2022-02-15 00:49:13,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:49:13,534 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 154 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:49:13,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 797 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-02-15 00:49:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4002 states. [2022-02-15 00:49:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4002 to 3143. [2022-02-15 00:49:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3143 states, 3138 states have (on average 1.4133205863607394) internal successors, (4435), 3138 states have internal predecessors, (4435), 3 states have call successors, (3), 3 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:49:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3143 states to 3143 states and 4439 transitions. [2022-02-15 00:49:13,568 INFO L78 Accepts]: Start accepts. Automaton has 3143 states and 4439 transitions. Word has length 212 [2022-02-15 00:49:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:49:13,568 INFO L470 AbstractCegarLoop]: Abstraction has 3143 states and 4439 transitions. [2022-02-15 00:49:13,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 2 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:49:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3143 states and 4439 transitions. [2022-02-15 00:49:13,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-02-15 00:49:13,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:49:13,571 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:49:13,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-02-15 00:49:13,571 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:49:13,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:49:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash -960382890, now seen corresponding path program 1 times [2022-02-15 00:49:13,572 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:49:13,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450193844] [2022-02-15 00:49:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:49:13,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:49:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:13,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:49:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-02-15 00:49:13,846 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:49:13,846 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450193844] [2022-02-15 00:49:13,846 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450193844] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:49:13,846 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:49:13,847 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 00:49:13,847 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66963800] [2022-02-15 00:49:13,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:49:13,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:49:13,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:49:13,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:49:13,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-15 00:49:13,848 INFO L87 Difference]: Start difference. First operand 3143 states and 4439 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 2 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:49:15,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:16,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:18,283 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:49:19,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:49:19,626 INFO L93 Difference]: Finished difference Result 3588 states and 5033 transitions. [2022-02-15 00:49:19,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:49:19,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 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 212 [2022-02-15 00:49:19,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:49:19,632 INFO L225 Difference]: With dead ends: 3588 [2022-02-15 00:49:19,632 INFO L226 Difference]: Without dead ends: 3574 [2022-02-15 00:49:19,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-15 00:49:19,632 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 243 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 106 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:49:19,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 383 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 471 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-02-15 00:49:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2022-02-15 00:49:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3154. [2022-02-15 00:49:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3154 states, 3149 states have (on average 1.4134645919339472) internal successors, (4451), 3149 states have internal predecessors, (4451), 3 states have call successors, (3), 3 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:49:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 4455 transitions. [2022-02-15 00:49:19,656 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 4455 transitions. Word has length 212 [2022-02-15 00:49:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:49:19,656 INFO L470 AbstractCegarLoop]: Abstraction has 3154 states and 4455 transitions. [2022-02-15 00:49:19,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 2 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:49:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 4455 transitions. [2022-02-15 00:49:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2022-02-15 00:49:19,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:49:19,660 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-02-15 00:49:19,660 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:49:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:49:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2000111424, now seen corresponding path program 1 times [2022-02-15 00:49:19,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:49:19,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99158151] [2022-02-15 00:49:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:49:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:49:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:19,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:49:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 145 proven. 5 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2022-02-15 00:49:19,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:49:19,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99158151] [2022-02-15 00:49:19,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99158151] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:49:19,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440479332] [2022-02-15 00:49:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:49:19,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:49:19,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:49:19,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:49:19,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-15 00:49:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:21,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-15 00:49:21,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:49:21,192 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:49:21,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:49:21,267 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:49:21,267 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:49:21,419 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-02-15 00:49:21,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:49:21,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-15 00:49:21,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-15 00:49:21,521 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-02-15 00:49:21,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-02-15 00:49:21,608 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-02-15 00:49:21,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-02-15 00:49:21,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-02-15 00:49:21,801 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 140 proven. 101 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-02-15 00:49:21,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:49:21,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-02-15 00:49:21,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-02-15 00:49:23,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (not (= 8545 (select (select (store |c_#memory_int| v_arrayElimCell_10 (store (select |c_#memory_int| v_arrayElimCell_10) (+ 844 v_arrayElimCell_11) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset))))) is different from false [2022-02-15 00:49:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-02-15 00:49:24,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440479332] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:49:24,155 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:49:24,156 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 10] total 14 [2022-02-15 00:49:24,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640601663] [2022-02-15 00:49:24,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:49:24,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:49:24,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:49:24,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:49:24,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-02-15 00:49:24,157 INFO L87 Difference]: Start difference. First operand 3154 states and 4455 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:49:26,182 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:49:27,725 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 8545 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))) (forall ((v_arrayElimCell_10 Int) (v_arrayElimCell_11 Int)) (not (= 8545 (select (select (store |c_#memory_int| v_arrayElimCell_10 (store (select |c_#memory_int| v_arrayElimCell_10) (+ 844 v_arrayElimCell_11) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))))) is different from false [2022-02-15 00:49:27,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:49:27,739 INFO L93 Difference]: Finished difference Result 3826 states and 5358 transitions. [2022-02-15 00:49:27,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:49:27,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 240 [2022-02-15 00:49:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:49:27,745 INFO L225 Difference]: With dead ends: 3826 [2022-02-15 00:49:27,746 INFO L226 Difference]: Without dead ends: 3826 [2022-02-15 00:49:27,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 479 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=42, Invalid=146, Unknown=2, NotChecked=50, Total=240 [2022-02-15 00:49:27,746 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 115 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 51 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:49:27,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 501 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 237 Invalid, 1 Unknown, 263 Unchecked, 2.3s Time] [2022-02-15 00:49:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2022-02-15 00:49:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 2951. [2022-02-15 00:49:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2951 states, 2946 states have (on average 1.4086897488119483) internal successors, (4150), 2946 states have internal predecessors, (4150), 3 states have call successors, (3), 3 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:49:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 4154 transitions. [2022-02-15 00:49:27,776 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 4154 transitions. Word has length 240 [2022-02-15 00:49:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:49:27,777 INFO L470 AbstractCegarLoop]: Abstraction has 2951 states and 4154 transitions. [2022-02-15 00:49:27,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:49:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4154 transitions. [2022-02-15 00:49:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-02-15 00:49:27,780 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:49:27,781 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:49:27,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-15 00:49:27,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-02-15 00:49:27,985 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:49:27,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:49:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 837080913, now seen corresponding path program 1 times [2022-02-15 00:49:27,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:49:27,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376685638] [2022-02-15 00:49:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:49:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:49:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:28,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:49:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 228 proven. 182 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-02-15 00:49:28,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:49:28,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376685638] [2022-02-15 00:49:28,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376685638] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:49:28,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18031669] [2022-02-15 00:49:28,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:49:28,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:49:28,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:49:28,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:49:28,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-15 00:49:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:49:29,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-15 00:49:29,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:49:29,636 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:49:29,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:49:29,689 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:49:29,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:49:29,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:49:29,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-02-15 00:49:29,924 INFO L353 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-02-15 00:49:29,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-02-15 00:49:29,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:49:29,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-02-15 00:49:30,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:49:30,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2022-02-15 00:49:30,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:49:30,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2022-02-15 00:49:30,915 INFO L353 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-02-15 00:49:30,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 65 [2022-02-15 00:49:30,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-02-15 00:49:30,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-02-15 00:49:30,987 INFO L353 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-02-15 00:49:30,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-02-15 00:49:31,002 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:49:31,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-15 00:49:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-02-15 00:49:31,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:49:31,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2022-02-15 00:49:31,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 136 [2022-02-15 00:49:31,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 130 [2022-02-15 00:49:31,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 224 [2022-02-15 00:49:33,725 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) is different from false [2022-02-15 00:49:33,808 INFO L353 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-02-15 00:49:33,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 1 [2022-02-15 00:49:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-02-15 00:49:33,948 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18031669] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:49:33,948 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 00:49:33,948 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-02-15 00:49:33,948 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118597390] [2022-02-15 00:49:33,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 00:49:33,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 00:49:33,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:49:33,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 00:49:33,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=603, Unknown=1, NotChecked=50, Total=756 [2022-02-15 00:49:33,950 INFO L87 Difference]: Start difference. First operand 2951 states and 4154 transitions. Second operand has 28 states, 28 states have (on average 12.321428571428571) internal successors, (345), 27 states have internal predecessors, (345), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:49:35,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:37,376 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:49:39,401 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:49:40,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:42,771 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:49:43,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:46,003 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:49:48,026 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:49:49,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:49:52,853 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (not (= (select .cse3 (+ 92 c_ssl3_accept_~s.offset)) 0)) (= (select .cse3 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse3 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-02-15 00:49:54,934 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (<= (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8448)) is different from false [2022-02-15 00:49:57,929 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse6 (+ 92 c_ssl3_accept_~s.offset)) (.cse7 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse7)) (.cse1 (select .cse8 .cse6))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 .cse0)) (= .cse1 0)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse4 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse4 8448)))) (store .cse2 v_arrayElimCell_28 (store (select .cse2 v_arrayElimCell_28) .cse3 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse4)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse3) 8672)))) (or (not (= |c_ssl3_accept_#t~mem145| 0)) (let ((.cse5 (= .cse1 |c_ssl3_accept_#t~mem145|))) (and (or .cse5 (= .cse6 (+ 844 .cse0))) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse7) c_ssl3_accept_~s.base) .cse5)))) (= (select .cse8 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse8 (+ 52 c_ssl3_accept_~s.offset)) 8448)))) is different from false [2022-02-15 00:50:00,138 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse6 (+ 92 c_ssl3_accept_~s.offset))) (let ((.cse7 (+ 84 c_ssl3_accept_~s.offset)) (.cse8 (select .cse9 .cse6))) (let ((.cse1 (= .cse8 0)) (.cse0 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse7))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 .cse0)) .cse1) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse4 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse4 8448)))) (store .cse2 v_arrayElimCell_28 (store (select .cse2 v_arrayElimCell_28) .cse3 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse4)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse3) 8672)))) (not .cse1) (or (not (= |c_ssl3_accept_#t~mem145| 0)) (let ((.cse5 (= .cse8 |c_ssl3_accept_#t~mem145|))) (and (or .cse5 (= .cse6 (+ 844 .cse0))) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse7) c_ssl3_accept_~s.base) .cse5)))) (= (select .cse9 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse9 (+ 52 c_ssl3_accept_~s.offset)) 8448))))) is different from false [2022-02-15 00:50:02,205 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) (+ 84 c_ssl3_accept_~s.offset)))) (= (select .cse0 (+ 92 c_ssl3_accept_~s.offset)) 0)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse2 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse1 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse3 8448)))) (store .cse1 v_arrayElimCell_28 (store (select .cse1 v_arrayElimCell_28) .cse2 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse3)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse2) 8672)))) (<= (select .cse0 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-02-15 00:50:05,737 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (= (select .cse3 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse3 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-02-15 00:50:08,117 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse8 (+ 92 c_ssl3_accept_~s.offset))) (let ((.cse9 (+ 84 c_ssl3_accept_~s.offset)) (.cse10 (select .cse11 .cse8))) (let ((.cse1 (= .cse10 0)) (.cse6 (= |c_ssl3_accept_#t~mem145| 0)) (.cse0 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse9)) (.cse5 (select .cse11 (+ 52 c_ssl3_accept_~s.offset)))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 .cse0)) .cse1) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse4 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse4 8448)))) (store .cse2 v_arrayElimCell_28 (store (select .cse2 v_arrayElimCell_28) .cse3 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse4)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse3) 8672)))) (or (and (not (= (+ 792 .cse0) c_ssl3_accept_~s.offset)) (= 8448 .cse5)) .cse6) (not .cse1) (or (not .cse6) (let ((.cse7 (= .cse10 |c_ssl3_accept_#t~mem145|))) (and (or .cse7 (= .cse8 (+ 844 .cse0))) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse9) c_ssl3_accept_~s.base) .cse7)))) (= (select .cse11 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= .cse5 8448))))) is different from false [2022-02-15 00:50:11,121 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) (+ 84 c_ssl3_accept_~s.offset)))) (= (select .cse0 (+ 92 c_ssl3_accept_~s.offset)) 0)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse2 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse1 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse3 8448)))) (store .cse1 v_arrayElimCell_28 (store (select .cse1 v_arrayElimCell_28) .cse2 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse3)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse2) 8672)))) (= (select .cse0 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse0 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-02-15 00:50:13,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (= (select .cse4 (+ 92 c_ssl3_accept_~s.offset)) 0))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) (+ 84 c_ssl3_accept_~s.offset)))) .cse0) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse2 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse1 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse3 8448)))) (store .cse1 v_arrayElimCell_28 (store (select .cse1 v_arrayElimCell_28) .cse2 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse3)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse2) 8672)))) (not .cse0) (= (select .cse4 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse4 (+ 52 c_ssl3_accept_~s.offset)) 8448)))) is different from false [2022-02-15 00:50:15,102 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (= 8448 (select .cse3 (+ 52 c_ssl3_accept_~s.offset))) (= (select .cse3 (+ 64 c_ssl3_accept_~s.offset)) 0))) is different from false [2022-02-15 00:50:17,623 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse6 (+ 92 c_ssl3_accept_~s.offset))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base)) (.cse8 (+ 84 c_ssl3_accept_~s.offset)) (.cse9 (select .cse10 .cse6))) (let ((.cse1 (= .cse9 0)) (.cse0 (select .cse5 .cse8))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 .cse0)) .cse1) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse4 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse4 8448)))) (store .cse2 v_arrayElimCell_28 (store (select .cse2 v_arrayElimCell_28) .cse3 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse4)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse3) 8672)))) (or (= (+ (select .cse5 (+ 176 c_ssl3_accept_~s.offset)) 172) .cse6) (not .cse1)) (or (not (= |c_ssl3_accept_#t~mem145| 0)) (let ((.cse7 (= .cse9 |c_ssl3_accept_#t~mem145|))) (and (or .cse7 (= .cse6 (+ 844 .cse0))) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse8) c_ssl3_accept_~s.base) .cse7)))) (= (select .cse10 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse10 (+ 52 c_ssl3_accept_~s.offset)) 8448))))) is different from false [2022-02-15 00:52:15,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) (+ 84 c_ssl3_accept_~s.offset)))) (= (select .cse0 (+ 92 c_ssl3_accept_~s.offset)) 0)) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse2 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse1 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse3 8448)))) (store .cse1 v_arrayElimCell_28 (store (select .cse1 v_arrayElimCell_28) .cse2 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse3)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse2) 8672)))) (= 8448 (select .cse0 (+ 52 c_ssl3_accept_~s.offset))) (= (select .cse0 (+ 64 c_ssl3_accept_~s.offset)) 0))) is different from false [2022-02-15 00:52:17,564 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) (+ 84 c_ssl3_accept_~s.offset))) (.cse1 (= (select .cse6 (+ 92 c_ssl3_accept_~s.offset)) 0)) (.cse5 (select .cse6 (+ 52 c_ssl3_accept_~s.offset)))) (and (or (<= c_ssl3_accept_~s.offset (+ 752 .cse0)) .cse1) (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse4 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse4 8448)))) (store .cse2 v_arrayElimCell_28 (store (select .cse2 v_arrayElimCell_28) .cse3 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse4)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse3) 8672)))) (or (and (not (= (+ 792 .cse0) c_ssl3_accept_~s.offset)) (= 8448 .cse5)) (= |c_ssl3_accept_#t~mem145| 0)) (not .cse1) (= (select .cse6 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= .cse5 8448)))) is different from false [2022-02-15 00:52:19,136 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_30 Int) (v_arrayElimCell_28 Int) (v_ArrVal_16335 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_30))) (or (not (= (let ((.cse2 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse0 (store |c_#memory_int| c_ssl3_accept_~s.base (store (select |c_#memory_int| c_ssl3_accept_~s.base) .cse2 8448)))) (store .cse0 v_arrayElimCell_28 (store (select .cse0 v_arrayElimCell_28) .cse1 v_ArrVal_16335))) c_ssl3_accept_~s.base) .cse2)) 8640)) (< (select (select |c_#memory_int| v_arrayElimCell_28) .cse1) 8672)))) (or (not (= |c_ssl3_accept_#t~mem145| 0)) (let ((.cse4 (+ 92 c_ssl3_accept_~s.offset))) (let ((.cse5 (+ 84 c_ssl3_accept_~s.offset)) (.cse3 (= (select .cse6 .cse4) |c_ssl3_accept_#t~mem145|))) (and (or .cse3 (= .cse4 (+ 844 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse5)))) (or (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse5) c_ssl3_accept_~s.base) .cse3))))) (= (select .cse6 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse6 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-02-15 00:52:19,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:52:19,219 INFO L93 Difference]: Finished difference Result 22329 states and 31285 transitions. [2022-02-15 00:52:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-02-15 00:52:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 12.321428571428571) internal successors, (345), 27 states have internal predecessors, (345), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 244 [2022-02-15 00:52:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:52:19,257 INFO L225 Difference]: With dead ends: 22329 [2022-02-15 00:52:19,257 INFO L226 Difference]: Without dead ends: 22329 [2022-02-15 00:52:19,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 502 SyntacticMatches, 13 SemanticMatches, 102 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 2549 ImplicationChecksByTransitivity, 146.1s TimeCoverageRelationStatistics Valid=983, Invalid=6830, Unknown=79, NotChecked=2820, Total=10712 [2022-02-15 00:52:19,259 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 1759 mSDsluCounter, 6553 mSDsCounter, 0 mSdLazyCounter, 5761 mSolverCounterSat, 320 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 7053 SdHoareTripleChecker+Invalid, 7868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 5761 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1782 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:52:19,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1759 Valid, 7053 Invalid, 7868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 5761 Invalid, 5 Unknown, 1782 Unchecked, 21.3s Time] [2022-02-15 00:52:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22329 states. [2022-02-15 00:52:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22329 to 9014. [2022-02-15 00:52:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9014 states, 9009 states have (on average 1.4317904317904318) internal successors, (12899), 9009 states have internal predecessors, (12899), 3 states have call successors, (3), 3 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:52:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9014 states to 9014 states and 12903 transitions. [2022-02-15 00:52:19,456 INFO L78 Accepts]: Start accepts. Automaton has 9014 states and 12903 transitions. Word has length 244 [2022-02-15 00:52:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:52:19,456 INFO L470 AbstractCegarLoop]: Abstraction has 9014 states and 12903 transitions. [2022-02-15 00:52:19,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.321428571428571) internal successors, (345), 27 states have internal predecessors, (345), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:52:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 9014 states and 12903 transitions. [2022-02-15 00:52:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-02-15 00:52:19,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:52:19,466 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:52:19,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-15 00:52:19,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-02-15 00:52:19,696 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:52:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:52:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1577342628, now seen corresponding path program 1 times [2022-02-15 00:52:19,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:52:19,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947858046] [2022-02-15 00:52:19,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:52:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:52:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:52:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:52:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:52:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 228 proven. 182 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-02-15 00:52:20,188 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:52:20,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947858046] [2022-02-15 00:52:20,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947858046] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:52:20,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619927533] [2022-02-15 00:52:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:52:20,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:52:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:52:20,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:52:20,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-15 00:52:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:52:21,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 1407 conjuncts, 44 conjunts are in the unsatisfiable core [2022-02-15 00:52:21,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:52:21,394 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:52:21,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:52:21,446 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:52:21,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:52:21,631 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:52:21,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-15 00:52:21,642 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:52:21,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-15 00:52:21,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:52:21,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-02-15 00:52:21,692 INFO L353 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-02-15 00:52:21,693 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-02-15 00:52:21,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:52:21,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-02-15 00:52:22,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:52:22,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-02-15 00:52:22,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:52:22,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-02-15 00:52:22,658 INFO L353 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-02-15 00:52:22,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 37 [2022-02-15 00:52:22,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-02-15 00:52:22,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-02-15 00:52:22,723 INFO L353 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-02-15 00:52:22,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-02-15 00:52:22,738 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:52:22,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-15 00:52:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-02-15 00:52:22,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:52:23,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2022-02-15 00:52:23,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 136 [2022-02-15 00:52:23,294 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 130 [2022-02-15 00:52:23,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 224 [2022-02-15 00:52:25,367 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_53)) (.cse0 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse0) v_arrayElimCell_51) .cse1) 8672) (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse0 .cse3 8448)))) (store .cse2 v_arrayElimCell_51 (store (select .cse2 v_arrayElimCell_51) .cse1 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse3)) 8640))))) is different from false [2022-02-15 00:52:27,468 INFO L353 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-02-15 00:52:27,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 1 [2022-02-15 00:52:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-02-15 00:52:27,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619927533] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:52:27,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 00:52:27,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 29 [2022-02-15 00:52:27,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554937006] [2022-02-15 00:52:27,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 00:52:27,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 00:52:27,611 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:52:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 00:52:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=649, Unknown=1, NotChecked=52, Total=812 [2022-02-15 00:52:27,612 INFO L87 Difference]: Start difference. First operand 9014 states and 12903 transitions. Second operand has 29 states, 29 states have (on average 12.0) internal successors, (348), 28 states have internal predecessors, (348), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:52:29,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:52:31,344 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:52:32,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:52:34,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:52:36,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:52:38,183 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:52:39,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:52:41,332 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:52:42,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:52:44,980 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:52:47,006 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:52:49,028 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:52:53,126 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_53)) (.cse0 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse0) v_arrayElimCell_51) .cse1) 8672) (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse0 .cse3 8448)))) (store .cse2 v_arrayElimCell_51 (store (select .cse2 v_arrayElimCell_51) .cse1 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse3)) 8640))))) (not (= (select .cse4 (+ 92 c_ssl3_accept_~s.offset)) 0)) (= (select .cse4 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse4 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-02-15 00:52:55,209 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_53)) (.cse0 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse0) v_arrayElimCell_51) .cse1) 8672) (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse0 .cse3 8448)))) (store .cse2 v_arrayElimCell_51 (store (select .cse2 v_arrayElimCell_51) .cse1 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse3)) 8640))))) (<= (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8448)) is different from false [2022-02-15 00:52:58,645 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (select .cse6 (+ 92 c_ssl3_accept_~s.offset)))) (and (or (= .cse0 0) (let ((.cse1 (+ 84 c_ssl3_accept_~s.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse1) c_ssl3_accept_~s.base) (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse1)))))) (or (= .cse0 |c_ssl3_accept_#t~mem145|) (not (= |c_ssl3_accept_#t~mem145| 0))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_53)) (.cse2 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse2) v_arrayElimCell_51) .cse3) 8672) (not (= (let ((.cse5 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse4 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse2 .cse5 8448)))) (store .cse4 v_arrayElimCell_51 (store (select .cse4 v_arrayElimCell_51) .cse3 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse5)) 8640))))) (= (select .cse6 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse6 (+ 52 c_ssl3_accept_~s.offset)) 8448)))) is different from false [2022-02-15 00:53:00,756 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse2 (select .cse7 (+ 92 c_ssl3_accept_~s.offset)))) (let ((.cse0 (= .cse2 0))) (and (or .cse0 (let ((.cse1 (+ 84 c_ssl3_accept_~s.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse1) c_ssl3_accept_~s.base) (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse1)))))) (or (= .cse2 |c_ssl3_accept_#t~mem145|) (not (= |c_ssl3_accept_#t~mem145| 0))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse4 (+ 844 v_arrayElimCell_53)) (.cse3 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse3) v_arrayElimCell_51) .cse4) 8672) (not (= (let ((.cse6 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse5 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse3 .cse6 8448)))) (store .cse5 v_arrayElimCell_51 (store (select .cse5 v_arrayElimCell_51) .cse4 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse6)) 8640))))) (not .cse0) (= (select .cse7 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse7 (+ 52 c_ssl3_accept_~s.offset)) 8448))))) is different from false [2022-02-15 00:53:02,843 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (or (= (select .cse0 (+ 92 c_ssl3_accept_~s.offset)) 0) (let ((.cse1 (+ 84 c_ssl3_accept_~s.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse1) c_ssl3_accept_~s.base) (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse1)))))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_53)) (.cse2 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse2) v_arrayElimCell_51) .cse3) 8672) (not (= (let ((.cse5 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse4 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse2 .cse5 8448)))) (store .cse4 v_arrayElimCell_51 (store (select .cse4 v_arrayElimCell_51) .cse3 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse5)) 8640))))) (<= (select .cse0 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-02-15 00:53:13,906 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))) (let ((.cse5 (<= .cse0 8448))) (and (let ((.cse6 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse6)) (.cse2 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse6))) (let ((.cse3 (= (+ 792 .cse2) c_ssl3_accept_~s.offset)) (.cse4 (= .cse1 c_ssl3_accept_~s.base))) (or (and (<= .cse0 (select (select |c_#memory_int| .cse1) (+ 844 .cse2))) (or (not .cse3) (not .cse4))) (and .cse3 .cse4 .cse5))))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse8 (+ 844 v_arrayElimCell_53)) (.cse7 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse7) v_arrayElimCell_51) .cse8) 8672) (not (= (let ((.cse10 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse9 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse7 .cse10 8448)))) (store .cse9 v_arrayElimCell_51 (store (select .cse9 v_arrayElimCell_51) .cse8 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse10)) 8640))))) .cse5))) is different from false [2022-02-15 00:53:17,425 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse1 (+ 844 v_arrayElimCell_53)) (.cse0 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse0) v_arrayElimCell_51) .cse1) 8672) (not (= (let ((.cse3 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse2 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse0 .cse3 8448)))) (store .cse2 v_arrayElimCell_51 (store (select .cse2 v_arrayElimCell_51) .cse1 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse3)) 8640))))) (= (select .cse4 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse4 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-02-15 00:53:38,293 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_ssl3_accept_~s.base))) (and (or (= (select .cse0 (+ 92 c_ssl3_accept_~s.offset)) 0) (let ((.cse1 (+ 84 c_ssl3_accept_~s.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse1) c_ssl3_accept_~s.base) (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse1)))))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_53)) (.cse2 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse2) v_arrayElimCell_51) .cse3) 8672) (not (= (let ((.cse5 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse4 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse2 .cse5 8448)))) (store .cse4 v_arrayElimCell_51 (store (select .cse4 v_arrayElimCell_51) .cse3 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse5)) 8640))))) (= (select .cse0 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse0 (+ 52 c_ssl3_accept_~s.offset)) 8448))) is different from false [2022-02-15 00:53:40,404 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse17 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse17)) (.cse15 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse10 (+ 52 c_ssl3_accept_~s.offset))) (let ((.cse0 (select .cse15 .cse10)) (.cse8 (select .cse15 (+ 92 c_ssl3_accept_~s.offset))) (.cse16 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse17)) (.cse5 (= (+ 792 .cse2) c_ssl3_accept_~s.offset))) (let ((.cse9 (= |c_ssl3_accept_#t~mem145| 0)) (.cse3 (not .cse5)) (.cse4 (= .cse16 c_ssl3_accept_~s.base)) (.cse1 (select |c_#memory_int| .cse16)) (.cse7 (= .cse8 0)) (.cse6 (<= .cse0 8448))) (and (or (and (<= .cse0 (select .cse1 (+ 844 .cse2))) (or .cse3 (not .cse4))) (and .cse5 .cse4 .cse6)) (or .cse7 (and .cse4 (<= c_ssl3_accept_~s.offset (+ 752 .cse2)))) (or (= .cse8 |c_ssl3_accept_#t~mem145|) (not .cse9)) (or .cse9 (and .cse3 .cse4 (= 8448 (select .cse1 .cse10)))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse12 (+ 844 v_arrayElimCell_53)) (.cse11 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse11) v_arrayElimCell_51) .cse12) 8672) (not (= (let ((.cse14 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse13 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse11 .cse14 8448)))) (store .cse13 v_arrayElimCell_51 (store (select .cse13 v_arrayElimCell_51) .cse12 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse14)) 8640))))) (not .cse7) (= (select .cse15 (+ 64 c_ssl3_accept_~s.offset)) 0) .cse6))))) is different from false [2022-02-15 00:53:44,662 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (+ 84 c_ssl3_accept_~s.offset)) (.cse6 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (select .cse6 (+ 52 c_ssl3_accept_~s.offset))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse11))) (let ((.cse4 (= .cse1 c_ssl3_accept_~s.base)) (.cse2 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse11)) (.cse5 (<= .cse0 8448))) (and (let ((.cse3 (= (+ 792 .cse2) c_ssl3_accept_~s.offset))) (or (and (<= .cse0 (select (select |c_#memory_int| .cse1) (+ 844 .cse2))) (or (not .cse3) (not .cse4))) (and .cse3 .cse4 .cse5))) (or (= (select .cse6 (+ 92 c_ssl3_accept_~s.offset)) 0) (and .cse4 (<= c_ssl3_accept_~s.offset (+ 752 .cse2)))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse8 (+ 844 v_arrayElimCell_53)) (.cse7 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse7) v_arrayElimCell_51) .cse8) 8672) (not (= (let ((.cse10 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse9 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse7 .cse10 8448)))) (store .cse9 v_arrayElimCell_51 (store (select .cse9 v_arrayElimCell_51) .cse8 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse10)) 8640))))) .cse5)))) is different from false [2022-02-15 00:53:49,854 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (= (select .cse6 (+ 92 c_ssl3_accept_~s.offset)) 0))) (and (or .cse0 (let ((.cse1 (+ 84 c_ssl3_accept_~s.offset))) (and (= (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse1) c_ssl3_accept_~s.base) (<= c_ssl3_accept_~s.offset (+ 752 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse1)))))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse3 (+ 844 v_arrayElimCell_53)) (.cse2 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse2) v_arrayElimCell_51) .cse3) 8672) (not (= (let ((.cse5 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse4 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse2 .cse5 8448)))) (store .cse4 v_arrayElimCell_51 (store (select .cse4 v_arrayElimCell_51) .cse3 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse5)) 8640))))) (not .cse0) (= (select .cse6 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse6 (+ 52 c_ssl3_accept_~s.offset)) 8448)))) is different from false [2022-02-15 00:53:52,868 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base)) (.cse4 (+ 176 c_ssl3_accept_~s.offset)) (.cse13 (select |c_#memory_int| c_ssl3_accept_~s.base)) (.cse1 (+ 92 c_ssl3_accept_~s.offset))) (let ((.cse8 (select .cse13 .cse1)) (.cse0 (select .cse6 .cse4))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base)) (.cse2 (= .cse0 c_ssl3_accept_~s.base)) (.cse5 (= .cse8 0))) (and (or (not (= (select (select |c_#memory_int| .cse0) .cse1) 0)) (not .cse2) (= (+ (select .cse3 .cse4) 172) .cse1)) (or .cse5 (let ((.cse7 (+ 84 c_ssl3_accept_~s.offset))) (and (= (select .cse6 .cse7) c_ssl3_accept_~s.base) (<= c_ssl3_accept_~s.offset (+ 752 (select .cse3 .cse7)))))) (or (= .cse8 |c_ssl3_accept_#t~mem145|) (not (= |c_ssl3_accept_#t~mem145| 0))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse10 (+ 844 v_arrayElimCell_53)) (.cse9 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse9) v_arrayElimCell_51) .cse10) 8672) (not (= (let ((.cse12 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse11 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse9 .cse12 8448)))) (store .cse11 v_arrayElimCell_51 (store (select .cse11 v_arrayElimCell_51) .cse10 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse12)) 8640))))) (or .cse2 (not .cse5)) (= (select .cse13 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse13 (+ 52 c_ssl3_accept_~s.offset)) 8448))))) is different from false [2022-02-15 00:53:54,971 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (select .cse5 (+ 92 c_ssl3_accept_~s.offset)))) (and (or (= .cse0 |c_ssl3_accept_#t~mem145|) (not (= |c_ssl3_accept_#t~mem145| 0))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse2 (+ 844 v_arrayElimCell_53)) (.cse1 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse1) v_arrayElimCell_51) .cse2) 8672) (not (= (let ((.cse4 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse3 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse1 .cse4 8448)))) (store .cse3 v_arrayElimCell_51 (store (select .cse3 v_arrayElimCell_51) .cse2 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse4)) 8640))))) (not (= .cse0 0)) (= (select .cse5 (+ 64 c_ssl3_accept_~s.offset)) 0) (<= (select .cse5 (+ 52 c_ssl3_accept_~s.offset)) 8448)))) is different from false [2022-02-15 00:53:57,050 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 84 c_ssl3_accept_~s.offset)) (.cse11 (select |c_#memory_int| c_ssl3_accept_~s.base))) (let ((.cse0 (select .cse11 (+ 52 c_ssl3_accept_~s.offset))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse12))) (let ((.cse4 (= .cse1 c_ssl3_accept_~s.base)) (.cse2 (select (select |c_#memory_$Pointer$.offset| c_ssl3_accept_~s.base) .cse12)) (.cse6 (= (select .cse11 (+ 92 c_ssl3_accept_~s.offset)) 0)) (.cse5 (<= .cse0 8448))) (and (let ((.cse3 (= (+ 792 .cse2) c_ssl3_accept_~s.offset))) (or (and (<= .cse0 (select (select |c_#memory_int| .cse1) (+ 844 .cse2))) (or (not .cse3) (not .cse4))) (and .cse3 .cse4 .cse5))) (or .cse6 (and .cse4 (<= c_ssl3_accept_~s.offset (+ 752 .cse2)))) (forall ((v_arrayElimCell_51 Int) (v_ArrVal_16957 Int) (v_arrayElimCell_53 Int) (v_ArrVal_16972 Int)) (let ((.cse8 (+ 844 v_arrayElimCell_53)) (.cse7 (store (select |c_#memory_int| c_ssl3_accept_~s.base) (+ c_ssl3_accept_~s.offset 24) v_ArrVal_16957))) (or (< (select (select (store |c_#memory_int| c_ssl3_accept_~s.base .cse7) v_arrayElimCell_51) .cse8) 8672) (not (= (let ((.cse10 (+ 52 c_ssl3_accept_~s.offset))) (select (select (let ((.cse9 (store |c_#memory_int| c_ssl3_accept_~s.base (store .cse7 .cse10 8448)))) (store .cse9 v_arrayElimCell_51 (store (select .cse9 v_arrayElimCell_51) .cse8 v_ArrVal_16972))) c_ssl3_accept_~s.base) .cse10)) 8640))))) (not .cse6) (= (select .cse11 (+ 64 c_ssl3_accept_~s.offset)) 0) .cse5)))) is different from false [2022-02-15 00:53:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:53:59,321 INFO L93 Difference]: Finished difference Result 50495 states and 70597 transitions. [2022-02-15 00:53:59,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-02-15 00:53:59,322 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 28 states have internal predecessors, (348), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 245 [2022-02-15 00:53:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:53:59,398 INFO L225 Difference]: With dead ends: 50495 [2022-02-15 00:53:59,398 INFO L226 Difference]: Without dead ends: 50495 [2022-02-15 00:53:59,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 520 SyntacticMatches, 26 SemanticMatches, 155 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 8558 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=2436, Invalid=17622, Unknown=24, NotChecked=4410, Total=24492 [2022-02-15 00:53:59,400 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 4123 mSDsluCounter, 7989 mSDsCounter, 0 mSdLazyCounter, 7475 mSolverCounterSat, 629 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4123 SdHoareTripleChecker+Valid, 8581 SdHoareTripleChecker+Invalid, 15068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 7475 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 6958 IncrementalHoareTripleChecker+Unchecked, 30.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:53:59,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4123 Valid, 8581 Invalid, 15068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 7475 Invalid, 6 Unknown, 6958 Unchecked, 30.4s Time] [2022-02-15 00:53:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50495 states. [2022-02-15 00:53:59,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50495 to 26780. [2022-02-15 00:53:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26780 states, 26775 states have (on average 1.4236041083099906) internal successors, (38117), 26775 states have internal predecessors, (38117), 3 states have call successors, (3), 3 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:54:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26780 states to 26780 states and 38121 transitions. [2022-02-15 00:54:00,000 INFO L78 Accepts]: Start accepts. Automaton has 26780 states and 38121 transitions. Word has length 245 [2022-02-15 00:54:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:54:00,001 INFO L470 AbstractCegarLoop]: Abstraction has 26780 states and 38121 transitions. [2022-02-15 00:54:00,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 12.0) internal successors, (348), 28 states have internal predecessors, (348), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 26780 states and 38121 transitions. [2022-02-15 00:54:00,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-02-15 00:54:00,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:54:00,022 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-02-15 00:54:00,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-15 00:54:00,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:54:00,288 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:54:00,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:54:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1642236613, now seen corresponding path program 1 times [2022-02-15 00:54:00,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:54:00,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223030292] [2022-02-15 00:54:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:54:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:54:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 479 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2022-02-15 00:54:00,877 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:54:00,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223030292] [2022-02-15 00:54:00,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223030292] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:54:00,877 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:54:00,877 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:54:00,877 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004850379] [2022-02-15 00:54:00,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:54:00,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:54:00,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:54:00,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:54:00,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:54:00,878 INFO L87 Difference]: Start difference. First operand 26780 states and 38121 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:02,890 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:54:04,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:54:04,020 INFO L93 Difference]: Finished difference Result 44526 states and 62202 transitions. [2022-02-15 00:54:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:54:04,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 245 [2022-02-15 00:54:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:54:04,079 INFO L225 Difference]: With dead ends: 44526 [2022-02-15 00:54:04,079 INFO L226 Difference]: Without dead ends: 44526 [2022-02-15 00:54:04,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:54:04,082 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 280 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:54:04,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 1151 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1211 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-02-15 00:54:04,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44526 states. [2022-02-15 00:54:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44526 to 26689. [2022-02-15 00:54:04,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26689 states, 26684 states have (on average 1.4250487183330836) internal successors, (38026), 26684 states have internal predecessors, (38026), 3 states have call successors, (3), 3 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:54:04,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26689 states to 26689 states and 38030 transitions. [2022-02-15 00:54:04,577 INFO L78 Accepts]: Start accepts. Automaton has 26689 states and 38030 transitions. Word has length 245 [2022-02-15 00:54:04,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:54:04,577 INFO L470 AbstractCegarLoop]: Abstraction has 26689 states and 38030 transitions. [2022-02-15 00:54:04,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 7 states have internal predecessors, (115), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 26689 states and 38030 transitions. [2022-02-15 00:54:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2022-02-15 00:54:04,594 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:54:04,594 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:54:04,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-02-15 00:54:04,594 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:54:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:54:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2124535176, now seen corresponding path program 1 times [2022-02-15 00:54:04,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:54:04,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29528004] [2022-02-15 00:54:04,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:54:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:05,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:54:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 291 proven. 2 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-02-15 00:54:05,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:54:05,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29528004] [2022-02-15 00:54:05,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29528004] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:54:05,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360922975] [2022-02-15 00:54:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:05,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:54:05,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:54:05,226 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:54:05,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-15 00:54:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:06,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-15 00:54:06,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:54:06,625 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:54:06,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:54:06,672 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:54:06,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:54:06,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-15 00:54:06,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:54:06,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-02-15 00:54:06,924 INFO L353 Elim1Store]: treesize reduction 50, result has 58.3 percent of original size [2022-02-15 00:54:06,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2022-02-15 00:54:06,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:54:06,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 70 [2022-02-15 00:54:07,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:54:07,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2022-02-15 00:54:07,484 INFO L353 Elim1Store]: treesize reduction 99, result has 17.5 percent of original size [2022-02-15 00:54:07,484 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 37 [2022-02-15 00:54:07,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:54:07,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-02-15 00:54:07,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2022-02-15 00:54:07,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-02-15 00:54:07,542 INFO L353 Elim1Store]: treesize reduction 39, result has 35.0 percent of original size [2022-02-15 00:54:07,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 36 [2022-02-15 00:54:07,558 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:54:07,558 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-15 00:54:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 244 proven. 108 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-02-15 00:54:07,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:54:08,342 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2022-02-15 00:54:08,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-15 00:54:08,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-02-15 00:54:08,349 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2022-02-15 00:54:08,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2022-02-15 00:54:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 257 proven. 36 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2022-02-15 00:54:08,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360922975] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:54:08,608 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 00:54:08,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-02-15 00:54:08,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104313913] [2022-02-15 00:54:08,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 00:54:08,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 00:54:08,609 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:54:08,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 00:54:08,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2022-02-15 00:54:08,609 INFO L87 Difference]: Start difference. First operand 26689 states and 38030 transitions. Second operand has 26 states, 26 states have (on average 11.653846153846153) internal successors, (303), 25 states have internal predecessors, (303), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:10,627 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:54:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:54:17,232 INFO L93 Difference]: Finished difference Result 59685 states and 84189 transitions. [2022-02-15 00:54:17,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-02-15 00:54:17,233 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.653846153846153) internal successors, (303), 25 states have internal predecessors, (303), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 245 [2022-02-15 00:54:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:54:17,327 INFO L225 Difference]: With dead ends: 59685 [2022-02-15 00:54:17,327 INFO L226 Difference]: Without dead ends: 59685 [2022-02-15 00:54:17,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 507 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=809, Invalid=3613, Unknown=0, NotChecked=0, Total=4422 [2022-02-15 00:54:17,328 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 2420 mSDsluCounter, 3818 mSDsCounter, 0 mSdLazyCounter, 4576 mSolverCounterSat, 525 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 4136 SdHoareTripleChecker+Invalid, 6218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 4576 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1116 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:54:17,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2420 Valid, 4136 Invalid, 6218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 4576 Invalid, 1 Unknown, 1116 Unchecked, 7.2s Time] [2022-02-15 00:54:17,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59685 states. [2022-02-15 00:54:17,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59685 to 27693. [2022-02-15 00:54:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27693 states, 27688 states have (on average 1.419387460271598) internal successors, (39300), 27688 states have internal predecessors, (39300), 3 states have call successors, (3), 3 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:54:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27693 states to 27693 states and 39304 transitions. [2022-02-15 00:54:17,981 INFO L78 Accepts]: Start accepts. Automaton has 27693 states and 39304 transitions. Word has length 245 [2022-02-15 00:54:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:54:17,981 INFO L470 AbstractCegarLoop]: Abstraction has 27693 states and 39304 transitions. [2022-02-15 00:54:17,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.653846153846153) internal successors, (303), 25 states have internal predecessors, (303), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:17,982 INFO L276 IsEmpty]: Start isEmpty. Operand 27693 states and 39304 transitions. [2022-02-15 00:54:18,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-02-15 00:54:18,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:54:18,001 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-02-15 00:54:18,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-15 00:54:18,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:54:18,219 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:54:18,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:54:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash -295147377, now seen corresponding path program 1 times [2022-02-15 00:54:18,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:54:18,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443625119] [2022-02-15 00:54:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:54:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:18,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:54:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 370 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-02-15 00:54:18,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:54:18,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443625119] [2022-02-15 00:54:18,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443625119] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:54:18,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43657626] [2022-02-15 00:54:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:18,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:54:18,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:54:18,462 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:54:18,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-15 00:54:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:19,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-15 00:54:19,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:54:19,713 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:54:19,713 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:54:19,758 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:54:19,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:54:19,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-02-15 00:54:19,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:54:19,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-15 00:54:19,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-15 00:54:19,929 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-02-15 00:54:19,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-02-15 00:54:19,987 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-02-15 00:54:19,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-02-15 00:54:21,295 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 00:54:21,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-02-15 00:54:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 363 proven. 68 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-15 00:54:21,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:54:21,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-02-15 00:54:21,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-02-15 00:54:22,631 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_85 Int) (v_arrayElimCell_86 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_85 (store (select |c_#memory_int| v_arrayElimCell_85) (+ 844 v_arrayElimCell_86) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8656))) is different from false [2022-02-15 00:54:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-02-15 00:54:22,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43657626] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:54:22,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:54:22,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 10] total 19 [2022-02-15 00:54:22,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869781500] [2022-02-15 00:54:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:54:22,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:54:22,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:54:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:54:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=258, Unknown=1, NotChecked=32, Total=342 [2022-02-15 00:54:22,713 INFO L87 Difference]: Start difference. First operand 27693 states and 39304 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:24,719 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:54:26,117 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_85 Int) (v_arrayElimCell_86 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_85 (store (select |c_#memory_int| v_arrayElimCell_85) (+ 844 v_arrayElimCell_86) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8656))) (not (= 8656 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset))))) is different from false [2022-02-15 00:54:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:54:26,211 INFO L93 Difference]: Finished difference Result 35029 states and 49586 transitions. [2022-02-15 00:54:26,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:54:26,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 256 [2022-02-15 00:54:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:54:26,280 INFO L225 Difference]: With dead ends: 35029 [2022-02-15 00:54:26,280 INFO L226 Difference]: Without dead ends: 35029 [2022-02-15 00:54:26,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=58, Invalid=290, Unknown=2, NotChecked=70, Total=420 [2022-02-15 00:54:26,281 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 102 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:54:26,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 641 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 244 Invalid, 1 Unknown, 265 Unchecked, 2.3s Time] [2022-02-15 00:54:26,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35029 states. [2022-02-15 00:54:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35029 to 31303. [2022-02-15 00:54:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31303 states, 31298 states have (on average 1.4221995015655953) internal successors, (44512), 31298 states have internal predecessors, (44512), 3 states have call successors, (3), 3 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:54:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31303 states to 31303 states and 44516 transitions. [2022-02-15 00:54:26,699 INFO L78 Accepts]: Start accepts. Automaton has 31303 states and 44516 transitions. Word has length 256 [2022-02-15 00:54:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:54:26,699 INFO L470 AbstractCegarLoop]: Abstraction has 31303 states and 44516 transitions. [2022-02-15 00:54:26,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 31303 states and 44516 transitions. [2022-02-15 00:54:26,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-02-15 00:54:26,719 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:54:26,720 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-02-15 00:54:26,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-15 00:54:26,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:54:26,925 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:54:26,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:54:26,927 INFO L85 PathProgramCache]: Analyzing trace with hash -768666320, now seen corresponding path program 1 times [2022-02-15 00:54:26,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:54:26,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866875841] [2022-02-15 00:54:26,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:54:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:27,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:54:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 372 proven. 68 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-02-15 00:54:27,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:54:27,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866875841] [2022-02-15 00:54:27,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866875841] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:54:27,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761088627] [2022-02-15 00:54:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:27,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:54:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:54:27,148 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:54:27,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-15 00:54:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:28,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-15 00:54:28,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:54:28,609 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:54:28,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:54:28,743 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:54:28,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:54:28,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-02-15 00:54:28,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:54:28,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-15 00:54:28,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-15 00:54:28,948 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-02-15 00:54:28,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-02-15 00:54:29,013 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-02-15 00:54:29,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-02-15 00:54:30,395 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 00:54:30,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-02-15 00:54:30,573 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 363 proven. 68 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-02-15 00:54:30,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:54:30,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-02-15 00:54:30,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-02-15 00:54:32,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (not (= 8656 (select (select (store |c_#memory_int| v_arrayElimCell_97 (store (select |c_#memory_int| v_arrayElimCell_97) (+ 844 v_arrayElimCell_98) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset))))) is different from false [2022-02-15 00:54:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-02-15 00:54:32,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761088627] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:54:32,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:54:32,970 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 10] total 17 [2022-02-15 00:54:32,970 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145452979] [2022-02-15 00:54:32,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:54:32,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:54:32,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:54:32,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:54:32,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=202, Unknown=1, NotChecked=28, Total=272 [2022-02-15 00:54:32,971 INFO L87 Difference]: Start difference. First operand 31303 states and 44516 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:34,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:54:36,625 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 8656 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))) (forall ((v_arrayElimCell_98 Int) (v_arrayElimCell_97 Int)) (not (= 8656 (select (select (store |c_#memory_int| v_arrayElimCell_97 (store (select |c_#memory_int| v_arrayElimCell_97) (+ 844 v_arrayElimCell_98) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))))) is different from false [2022-02-15 00:54:36,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:54:36,717 INFO L93 Difference]: Finished difference Result 34874 states and 49380 transitions. [2022-02-15 00:54:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:54:36,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 256 [2022-02-15 00:54:36,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:54:36,765 INFO L225 Difference]: With dead ends: 34874 [2022-02-15 00:54:36,766 INFO L226 Difference]: Without dead ends: 34874 [2022-02-15 00:54:36,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=47, Invalid=231, Unknown=2, NotChecked=62, Total=342 [2022-02-15 00:54:36,766 INFO L933 BasicCegarLoop]: 214 mSDtfsCounter, 102 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-15 00:54:36,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 601 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 245 Invalid, 0 Unknown, 228 Unchecked, 1.6s Time] [2022-02-15 00:54:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34874 states. [2022-02-15 00:54:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34874 to 31103. [2022-02-15 00:54:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31103 states, 31098 states have (on average 1.421859926683388) internal successors, (44217), 31098 states have internal predecessors, (44217), 3 states have call successors, (3), 3 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:54:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31103 states to 31103 states and 44221 transitions. [2022-02-15 00:54:37,243 INFO L78 Accepts]: Start accepts. Automaton has 31103 states and 44221 transitions. Word has length 256 [2022-02-15 00:54:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:54:37,243 INFO L470 AbstractCegarLoop]: Abstraction has 31103 states and 44221 transitions. [2022-02-15 00:54:37,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 31103 states and 44221 transitions. [2022-02-15 00:54:37,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-02-15 00:54:37,266 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:54:37,267 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:54:37,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-15 00:54:37,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:54:37,472 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:54:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:54:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash -529743717, now seen corresponding path program 1 times [2022-02-15 00:54:37,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:54:37,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824858423] [2022-02-15 00:54:37,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:54:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:37,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:54:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:37,929 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 372 proven. 72 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-02-15 00:54:37,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:54:37,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824858423] [2022-02-15 00:54:37,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824858423] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:54:37,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724065445] [2022-02-15 00:54:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:37,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:54:37,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:54:37,956 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:54:37,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-15 00:54:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:39,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 1439 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-15 00:54:39,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:54:39,295 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:54:39,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:54:39,343 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:54:39,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:54:39,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:54:39,474 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-15 00:54:39,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-15 00:54:39,493 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-02-15 00:54:39,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-02-15 00:54:39,556 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-02-15 00:54:39,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-02-15 00:54:39,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:54:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 375 proven. 48 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-02-15 00:54:39,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:54:40,118 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-02-15 00:54:40,120 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-02-15 00:54:42,124 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (not (= 8657 (select (select (store |c_#memory_int| v_arrayElimCell_107 (store (select |c_#memory_int| v_arrayElimCell_107) (+ v_arrayElimCell_108 844) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset))))) is different from false [2022-02-15 00:54:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-02-15 00:54:42,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724065445] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:54:42,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:54:42,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 9] total 19 [2022-02-15 00:54:42,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021800130] [2022-02-15 00:54:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:54:42,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 00:54:42,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:54:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 00:54:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=252, Unknown=1, NotChecked=32, Total=342 [2022-02-15 00:54:42,257 INFO L87 Difference]: Start difference. First operand 31103 states and 44221 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:44,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:54:47,035 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 8657 (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))) (forall ((v_arrayElimCell_108 Int) (v_arrayElimCell_107 Int)) (not (= 8657 (select (select (store |c_#memory_int| v_arrayElimCell_107 (store (select |c_#memory_int| v_arrayElimCell_107) (+ v_arrayElimCell_108 844) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)))))) is different from false [2022-02-15 00:54:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:54:47,112 INFO L93 Difference]: Finished difference Result 32881 states and 46675 transitions. [2022-02-15 00:54:47,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:54:47,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 257 [2022-02-15 00:54:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:54:47,152 INFO L225 Difference]: With dead ends: 32881 [2022-02-15 00:54:47,152 INFO L226 Difference]: Without dead ends: 32846 [2022-02-15 00:54:47,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 510 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=64, Invalid=284, Unknown=2, NotChecked=70, Total=420 [2022-02-15 00:54:47,152 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 136 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:54:47,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 608 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 311 Invalid, 0 Unknown, 260 Unchecked, 2.8s Time] [2022-02-15 00:54:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32846 states. [2022-02-15 00:54:47,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32846 to 31278. [2022-02-15 00:54:47,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31278 states, 31273 states have (on average 1.4164295078821987) internal successors, (44296), 31273 states have internal predecessors, (44296), 3 states have call successors, (3), 3 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:54:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31278 states to 31278 states and 44300 transitions. [2022-02-15 00:54:47,531 INFO L78 Accepts]: Start accepts. Automaton has 31278 states and 44300 transitions. Word has length 257 [2022-02-15 00:54:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:54:47,532 INFO L470 AbstractCegarLoop]: Abstraction has 31278 states and 44300 transitions. [2022-02-15 00:54:47,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:54:47,532 INFO L276 IsEmpty]: Start isEmpty. Operand 31278 states and 44300 transitions. [2022-02-15 00:54:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-02-15 00:54:47,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:54:47,550 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-02-15 00:54:47,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-15 00:54:47,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:54:47,768 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:54:47,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:54:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1971038234, now seen corresponding path program 1 times [2022-02-15 00:54:47,768 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:54:47,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329496366] [2022-02-15 00:54:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:54:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:54:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:54:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:54:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-02-15 00:54:48,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:54:48,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329496366] [2022-02-15 00:54:48,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329496366] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:54:48,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:54:48,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 00:54:48,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231226762] [2022-02-15 00:54:48,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:54:48,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 00:54:48,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:54:48,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 00:54:48,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-15 00:54:48,097 INFO L87 Difference]: Start difference. First operand 31278 states and 44300 transitions. Second operand has 8 states, 8 states have (on average 19.625) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (3), 2 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:54:50,027 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:54:52,050 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:54:53,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:54:55,997 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:54:57,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:54:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:54:59,743 INFO L93 Difference]: Finished difference Result 40660 states and 56523 transitions. [2022-02-15 00:54:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 00:54:59,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (3), 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 257 [2022-02-15 00:54:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:54:59,797 INFO L225 Difference]: With dead ends: 40660 [2022-02-15 00:54:59,797 INFO L226 Difference]: Without dead ends: 40660 [2022-02-15 00:54:59,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:54:59,797 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 480 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 87 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-02-15 00:54:59,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [480 Valid, 1247 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1567 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2022-02-15 00:54:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40660 states. [2022-02-15 00:55:00,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40660 to 31628. [2022-02-15 00:55:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31628 states, 31623 states have (on average 1.4161211776238813) internal successors, (44782), 31623 states have internal predecessors, (44782), 3 states have call successors, (3), 3 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:55:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31628 states to 31628 states and 44786 transitions. [2022-02-15 00:55:00,292 INFO L78 Accepts]: Start accepts. Automaton has 31628 states and 44786 transitions. Word has length 257 [2022-02-15 00:55:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:55:00,292 INFO L470 AbstractCegarLoop]: Abstraction has 31628 states and 44786 transitions. [2022-02-15 00:55:00,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.625) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (3), 2 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:55:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 31628 states and 44786 transitions. [2022-02-15 00:55:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-02-15 00:55:00,325 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:55:00,326 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 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:55:00,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-02-15 00:55:00,326 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:55:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:55:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash -831762783, now seen corresponding path program 1 times [2022-02-15 00:55:00,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:55:00,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512477912] [2022-02-15 00:55:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:55:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:55:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:00,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:55:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-02-15 00:55:00,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:55:00,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512477912] [2022-02-15 00:55:00,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512477912] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:55:00,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766499951] [2022-02-15 00:55:00,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:55:00,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:55:00,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:55:00,562 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:55:00,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-15 00:55:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:02,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 1559 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-15 00:55:02,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:55:02,206 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:55:02,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:55:02,250 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:55:02,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:55:02,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-02-15 00:55:02,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:55:02,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:55:02,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:55:02,555 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-15 00:55:02,555 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 49 [2022-02-15 00:55:02,571 INFO L353 Elim1Store]: treesize reduction 35, result has 45.3 percent of original size [2022-02-15 00:55:02,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 52 [2022-02-15 00:55:02,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2022-02-15 00:55:02,592 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-02-15 00:55:02,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-02-15 00:55:02,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:02,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2022-02-15 00:55:02,665 INFO L353 Elim1Store]: treesize reduction 102, result has 35.4 percent of original size [2022-02-15 00:55:02,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 98 [2022-02-15 00:55:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 300 proven. 103 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-02-15 00:55:02,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:55:02,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 120 [2022-02-15 00:55:02,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2022-02-15 00:55:03,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 263 [2022-02-15 00:55:03,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_20742 (Array Int Int)) (v_arrayElimCell_122 Int) (v_arrayElimCell_121 Int) (v_arrayElimCell_123 Int) (v_ArrVal_20750 (Array Int Int)) (v_ArrVal_20747 Int) (v_ArrVal_20745 Int)) (let ((.cse6 (+ 84 c_ssl3_accept_~s.offset))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_ssl3_accept_~s.base) .cse6))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_20742)) (.cse7 (+ 64 c_ssl3_accept_~s.offset))) (let ((.cse5 (store (select .cse4 c_ssl3_accept_~s.base) .cse7 v_ArrVal_20745)) (.cse3 (store |c_#memory_int| .cse8 (store (select |c_#memory_int| .cse8) (+ v_arrayElimCell_123 844) 3)))) (let ((.cse1 (store (select .cse3 c_ssl3_accept_~s.base) .cse7 v_ArrVal_20747)) (.cse0 (select .cse5 .cse6))) (or (not (= c_ssl3_accept_~s.base .cse0)) (not (= (select .cse1 (+ 52 c_ssl3_accept_~s.offset)) 8528)) (not (= (select (select (let ((.cse2 (store .cse3 c_ssl3_accept_~s.base .cse1))) (store .cse2 .cse0 (store (select .cse2 .cse0) (+ v_arrayElimCell_121 871) 1))) (select (select (store (store .cse4 c_ssl3_accept_~s.base .cse5) .cse0 v_ArrVal_20750) c_ssl3_accept_~s.base) .cse6)) (+ v_arrayElimCell_122 871)) 0))))))))) is different from false [2022-02-15 00:55:03,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:03,370 INFO L353 Elim1Store]: treesize reduction 999, result has 0.1 percent of original size [2022-02-15 00:55:03,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 8017 treesize of output 1 [2022-02-15 00:55:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-02-15 00:55:03,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1766499951] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:55:03,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:55:03,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 10] total 20 [2022-02-15 00:55:03,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568249288] [2022-02-15 00:55:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:55:03,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 00:55:03,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:55:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 00:55:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=5, NotChecked=34, Total=380 [2022-02-15 00:55:03,552 INFO L87 Difference]: Start difference. First operand 31628 states and 44786 transitions. Second operand has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:55:05,558 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:55:05,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:55:05,837 INFO L93 Difference]: Finished difference Result 32148 states and 45476 transitions. [2022-02-15 00:55:05,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 00:55:05,838 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 267 [2022-02-15 00:55:05,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:55:05,878 INFO L225 Difference]: With dead ends: 32148 [2022-02-15 00:55:05,878 INFO L226 Difference]: Without dead ends: 32148 [2022-02-15 00:55:05,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=343, Unknown=6, NotChecked=38, Total=462 [2022-02-15 00:55:05,879 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 25 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 752 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-15 00:55:05,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 1213 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 1 Unknown, 752 Unchecked, 2.2s Time] [2022-02-15 00:55:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32148 states. [2022-02-15 00:55:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32148 to 32064. [2022-02-15 00:55:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32064 states, 32059 states have (on average 1.4152032190648491) internal successors, (45370), 32059 states have internal predecessors, (45370), 3 states have call successors, (3), 3 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:55:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32064 states to 32064 states and 45374 transitions. [2022-02-15 00:55:06,288 INFO L78 Accepts]: Start accepts. Automaton has 32064 states and 45374 transitions. Word has length 267 [2022-02-15 00:55:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:55:06,288 INFO L470 AbstractCegarLoop]: Abstraction has 32064 states and 45374 transitions. [2022-02-15 00:55:06,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.77777777777778) internal successors, (151), 9 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:55:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 32064 states and 45374 transitions. [2022-02-15 00:55:06,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-02-15 00:55:06,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:55:06,317 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 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:55:06,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-15 00:55:06,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-02-15 00:55:06,524 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:55:06,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:55:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash -501997022, now seen corresponding path program 1 times [2022-02-15 00:55:06,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:55:06,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527216524] [2022-02-15 00:55:06,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:55:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:55:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:06,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:55:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 304 proven. 8 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2022-02-15 00:55:06,813 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:55:06,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527216524] [2022-02-15 00:55:06,813 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527216524] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:55:06,813 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159424311] [2022-02-15 00:55:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:55:06,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:55:06,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:55:06,828 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:55:06,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-15 00:55:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:08,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 1560 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-15 00:55:08,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:55:08,514 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:55:08,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:55:08,556 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:55:08,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:55:08,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-02-15 00:55:08,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:55:08,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:55:08,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:55:08,757 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-15 00:55:08,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-15 00:55:08,774 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-02-15 00:55:08,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-02-15 00:55:08,869 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-02-15 00:55:08,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-02-15 00:55:08,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-02-15 00:55:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 299 proven. 104 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-02-15 00:55:09,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:55:09,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-02-15 00:55:09,311 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-02-15 00:55:09,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159424311] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:55:09,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:55:09,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 10] total 13 [2022-02-15 00:55:09,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737901810] [2022-02-15 00:55:09,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:55:09,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:55:09,312 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:55:09,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:55:09,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-15 00:55:09,312 INFO L87 Difference]: Start difference. First operand 32064 states and 45374 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:55:11,319 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:55:11,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:55:11,728 INFO L93 Difference]: Finished difference Result 35033 states and 48882 transitions. [2022-02-15 00:55:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:55:11,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 267 [2022-02-15 00:55:11,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:55:11,774 INFO L225 Difference]: With dead ends: 35033 [2022-02-15 00:55:11,774 INFO L226 Difference]: Without dead ends: 35033 [2022-02-15 00:55:11,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 546 GetRequests, 532 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-02-15 00:55:11,775 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 116 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 47 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-15 00:55:11,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 410 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 241 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-02-15 00:55:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35033 states. [2022-02-15 00:55:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35033 to 32538. [2022-02-15 00:55:12,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32538 states, 32533 states have (on average 1.3956290535763687) internal successors, (45404), 32533 states have internal predecessors, (45404), 3 states have call successors, (3), 3 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:55:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32538 states to 32538 states and 45408 transitions. [2022-02-15 00:55:12,213 INFO L78 Accepts]: Start accepts. Automaton has 32538 states and 45408 transitions. Word has length 267 [2022-02-15 00:55:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:55:12,213 INFO L470 AbstractCegarLoop]: Abstraction has 32538 states and 45408 transitions. [2022-02-15 00:55:12,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:55:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 32538 states and 45408 transitions. [2022-02-15 00:55:12,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-02-15 00:55:12,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:55:12,240 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 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:55:12,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-15 00:55:12,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-02-15 00:55:12,450 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:55:12,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:55:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash 493430218, now seen corresponding path program 1 times [2022-02-15 00:55:12,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:55:12,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391054541] [2022-02-15 00:55:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:55:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:55:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:12,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:55:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 306 proven. 7 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-02-15 00:55:12,681 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:55:12,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391054541] [2022-02-15 00:55:12,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391054541] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:55:12,681 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990306461] [2022-02-15 00:55:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:55:12,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:55:12,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:55:12,682 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:55:12,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-15 00:55:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:14,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-15 00:55:14,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:55:14,231 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:55:14,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:55:14,276 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:55:14,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:55:14,406 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-02-15 00:55:14,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:55:14,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-15 00:55:14,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-15 00:55:14,488 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-02-15 00:55:14,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-02-15 00:55:14,540 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-02-15 00:55:14,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-02-15 00:55:15,173 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 00:55:15,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-02-15 00:55:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 301 proven. 103 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-02-15 00:55:15,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:55:15,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-02-15 00:55:15,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-02-15 00:55:16,250 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_146 Int) (v_arrayElimCell_145 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_145 (store (select |c_#memory_int| v_arrayElimCell_145) (+ v_arrayElimCell_146 844) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) is different from false [2022-02-15 00:55:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-02-15 00:55:16,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990306461] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:55:16,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:55:16,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 10] total 14 [2022-02-15 00:55:16,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190275041] [2022-02-15 00:55:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:55:16,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:55:16,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:55:16,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:55:16,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-02-15 00:55:16,461 INFO L87 Difference]: Start difference. First operand 32538 states and 45408 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:55:18,960 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_146 Int) (v_arrayElimCell_145 Int)) (not (= (select (select (store |c_#memory_int| v_arrayElimCell_145 (store (select |c_#memory_int| v_arrayElimCell_145) (+ v_arrayElimCell_146 844) 3)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) (not (= (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) is different from false [2022-02-15 00:55:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:55:19,051 INFO L93 Difference]: Finished difference Result 23600 states and 32554 transitions. [2022-02-15 00:55:19,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:55:19,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 268 [2022-02-15 00:55:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:55:19,080 INFO L225 Difference]: With dead ends: 23600 [2022-02-15 00:55:19,081 INFO L226 Difference]: Without dead ends: 23600 [2022-02-15 00:55:19,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 534 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=42, Invalid=146, Unknown=2, NotChecked=50, Total=240 [2022-02-15 00:55:19,081 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 115 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-15 00:55:19,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 539 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 238 Invalid, 0 Unknown, 248 Unchecked, 0.9s Time] [2022-02-15 00:55:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23600 states. [2022-02-15 00:55:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23600 to 5995. [2022-02-15 00:55:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5995 states, 5990 states have (on average 1.3801335559265442) internal successors, (8267), 5990 states have internal predecessors, (8267), 3 states have call successors, (3), 3 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:55:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5995 states to 5995 states and 8271 transitions. [2022-02-15 00:55:19,222 INFO L78 Accepts]: Start accepts. Automaton has 5995 states and 8271 transitions. Word has length 268 [2022-02-15 00:55:19,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:55:19,222 INFO L470 AbstractCegarLoop]: Abstraction has 5995 states and 8271 transitions. [2022-02-15 00:55:19,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:55:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 5995 states and 8271 transitions. [2022-02-15 00:55:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-02-15 00:55:19,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:55:19,228 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:55:19,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-02-15 00:55:19,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-02-15 00:55:19,443 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:55:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:55:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1207140096, now seen corresponding path program 1 times [2022-02-15 00:55:19,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:55:19,444 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261225871] [2022-02-15 00:55:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:55:19,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:55:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:19,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:55:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-02-15 00:55:19,719 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:55:19,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261225871] [2022-02-15 00:55:19,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261225871] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:55:19,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:55:19,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 00:55:19,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152021102] [2022-02-15 00:55:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:55:19,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 00:55:19,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:55:19,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 00:55:19,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-15 00:55:19,721 INFO L87 Difference]: Start difference. First operand 5995 states and 8271 transitions. Second operand has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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:55:20,750 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:55:22,773 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:55:25,764 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:55:27,795 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:55:29,817 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:55:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:55:30,318 INFO L93 Difference]: Finished difference Result 6003 states and 8281 transitions. [2022-02-15 00:55:30,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 00:55:30,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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 268 [2022-02-15 00:55:30,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:55:30,324 INFO L225 Difference]: With dead ends: 6003 [2022-02-15 00:55:30,324 INFO L226 Difference]: Without dead ends: 5995 [2022-02-15 00:55:30,324 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:55:30,324 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 7 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:55:30,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 842 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 440 Invalid, 4 Unknown, 0 Unchecked, 10.5s Time] [2022-02-15 00:55:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5995 states. [2022-02-15 00:55:30,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5995 to 5995. [2022-02-15 00:55:30,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5995 states, 5990 states have (on average 1.379966611018364) internal successors, (8266), 5990 states have internal predecessors, (8266), 3 states have call successors, (3), 3 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:55:30,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5995 states to 5995 states and 8270 transitions. [2022-02-15 00:55:30,366 INFO L78 Accepts]: Start accepts. Automaton has 5995 states and 8270 transitions. Word has length 268 [2022-02-15 00:55:30,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:55:30,366 INFO L470 AbstractCegarLoop]: Abstraction has 5995 states and 8270 transitions. [2022-02-15 00:55:30,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 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:55:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 5995 states and 8270 transitions. [2022-02-15 00:55:30,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-02-15 00:55:30,371 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:55:30,371 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 00:55:30,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-02-15 00:55:30,371 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:55:30,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:55:30,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1691776927, now seen corresponding path program 1 times [2022-02-15 00:55:30,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:55:30,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137177818] [2022-02-15 00:55:30,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:55:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:55:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:31,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:55:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 291 proven. 209 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-02-15 00:55:31,526 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:55:31,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137177818] [2022-02-15 00:55:31,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137177818] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:55:31,526 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650382086] [2022-02-15 00:55:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:55:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:55:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:55:31,527 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:55:31,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-15 00:55:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:55:33,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 1564 conjuncts, 67 conjunts are in the unsatisfiable core [2022-02-15 00:55:33,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:55:33,470 INFO L353 Elim1Store]: treesize reduction 73, result has 37.1 percent of original size [2022-02-15 00:55:33,470 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 120 [2022-02-15 00:55:33,499 INFO L353 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-02-15 00:55:33,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 216 [2022-02-15 00:55:33,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:33,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 155 [2022-02-15 00:55:33,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:33,561 INFO L353 Elim1Store]: treesize reduction 56, result has 49.5 percent of original size [2022-02-15 00:55:33,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 92 [2022-02-15 00:55:33,577 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 00:55:33,578 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-02-15 00:55:33,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2022-02-15 00:55:33,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-02-15 00:55:33,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-02-15 00:55:33,657 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-15 00:55:33,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2022-02-15 00:55:33,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2022-02-15 00:55:33,705 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2022-02-15 00:55:33,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:33,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:33,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:33,739 INFO L353 Elim1Store]: treesize reduction 54, result has 45.5 percent of original size [2022-02-15 00:55:33,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 108 [2022-02-15 00:55:33,761 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 00:55:33,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2022-02-15 00:55:33,794 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 00:55:33,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2022-02-15 00:55:33,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:33,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-15 00:55:33,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:33,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-02-15 00:55:33,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2022-02-15 00:55:34,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:34,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 107 [2022-02-15 00:55:34,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:34,676 INFO L353 Elim1Store]: treesize reduction 168, result has 34.6 percent of original size [2022-02-15 00:55:34,677 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 114 treesize of output 159 [2022-02-15 00:55:34,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:34,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 112 [2022-02-15 00:55:36,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:36,857 INFO L353 Elim1Store]: treesize reduction 48, result has 55.1 percent of original size [2022-02-15 00:55:36,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 182 treesize of output 138 [2022-02-15 00:55:37,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:37,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-02-15 00:55:37,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:37,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-02-15 00:55:37,206 INFO L353 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-02-15 00:55:37,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 96 [2022-02-15 00:55:37,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-02-15 00:55:37,231 INFO L353 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-02-15 00:55:37,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 67 [2022-02-15 00:55:37,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:37,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2022-02-15 00:55:37,315 INFO L353 Elim1Store]: treesize reduction 49, result has 46.7 percent of original size [2022-02-15 00:55:37,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 56 [2022-02-15 00:55:37,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:37,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 74 [2022-02-15 00:55:38,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 87 [2022-02-15 00:55:38,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 57 [2022-02-15 00:55:38,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:55:38,108 INFO L353 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2022-02-15 00:55:38,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 44 [2022-02-15 00:55:39,314 INFO L353 Elim1Store]: treesize reduction 15, result has 48.3 percent of original size [2022-02-15 00:55:39,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2022-02-15 00:55:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 370 proven. 153 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-02-15 00:55:39,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:55:39,520 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 279 treesize of output 195 [2022-02-15 00:55:45,588 INFO L353 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2022-02-15 00:55:45,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 5854 treesize of output 1 [2022-02-15 00:55:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 371 proven. 152 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-02-15 00:55:45,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650382086] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:55:45,650 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 00:55:45,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 29 [2022-02-15 00:55:45,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001412757] [2022-02-15 00:55:45,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 00:55:45,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-02-15 00:55:45,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:55:45,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-15 00:55:45,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=707, Unknown=0, NotChecked=0, Total=812 [2022-02-15 00:55:45,651 INFO L87 Difference]: Start difference. First operand 5995 states and 8270 transitions. Second operand has 29 states, 28 states have (on average 19.964285714285715) internal successors, (559), 26 states have internal predecessors, (559), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:55:48,466 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:55:50,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:55:53,242 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:55:55,269 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:55:57,303 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:55:59,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:56:00,496 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:56:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:56:09,587 INFO L93 Difference]: Finished difference Result 23408 states and 32853 transitions. [2022-02-15 00:56:09,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-02-15 00:56:09,587 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 19.964285714285715) internal successors, (559), 26 states have internal predecessors, (559), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 268 [2022-02-15 00:56:09,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:56:09,608 INFO L225 Difference]: With dead ends: 23408 [2022-02-15 00:56:09,608 INFO L226 Difference]: Without dead ends: 23408 [2022-02-15 00:56:09,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 591 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1563, Invalid=5577, Unknown=0, NotChecked=0, Total=7140 [2022-02-15 00:56:09,609 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 6273 mSDsluCounter, 6550 mSDsCounter, 0 mSdLazyCounter, 6560 mSolverCounterSat, 1032 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6273 SdHoareTripleChecker+Valid, 7007 SdHoareTripleChecker+Invalid, 12002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1032 IncrementalHoareTripleChecker+Valid, 6560 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 4405 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2022-02-15 00:56:09,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6273 Valid, 7007 Invalid, 12002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1032 Valid, 6560 Invalid, 5 Unknown, 4405 Unchecked, 21.1s Time] [2022-02-15 00:56:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23408 states. [2022-02-15 00:56:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23408 to 16806. [2022-02-15 00:56:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16806 states, 16801 states have (on average 1.4276531158859591) internal successors, (23986), 16801 states have internal predecessors, (23986), 3 states have call successors, (3), 3 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:56:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16806 states to 16806 states and 23990 transitions. [2022-02-15 00:56:09,766 INFO L78 Accepts]: Start accepts. Automaton has 16806 states and 23990 transitions. Word has length 268 [2022-02-15 00:56:09,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:56:09,766 INFO L470 AbstractCegarLoop]: Abstraction has 16806 states and 23990 transitions. [2022-02-15 00:56:09,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 19.964285714285715) internal successors, (559), 26 states have internal predecessors, (559), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:56:09,766 INFO L276 IsEmpty]: Start isEmpty. Operand 16806 states and 23990 transitions. [2022-02-15 00:56:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-02-15 00:56:09,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:56:09,774 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 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:56:09,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-15 00:56:09,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:56:09,995 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:56:09,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:56:09,996 INFO L85 PathProgramCache]: Analyzing trace with hash -689929165, now seen corresponding path program 1 times [2022-02-15 00:56:09,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:56:09,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457105060] [2022-02-15 00:56:09,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:56:09,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:56:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:56:10,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:56:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:56:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 306 proven. 7 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2022-02-15 00:56:10,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:56:10,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457105060] [2022-02-15 00:56:10,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457105060] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:56:10,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551095567] [2022-02-15 00:56:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:56:10,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:56:10,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:56:10,202 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:56:10,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-15 00:56:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:56:11,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 1615 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-15 00:56:11,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:56:11,717 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-15 00:56:11,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-02-15 00:56:11,758 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-15 00:56:11,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2022-02-15 00:56:11,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-02-15 00:56:11,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-15 00:56:11,949 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-02-15 00:56:11,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2022-02-15 00:56:11,964 INFO L353 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2022-02-15 00:56:11,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-02-15 00:56:12,009 INFO L353 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-02-15 00:56:12,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 54 [2022-02-15 00:56:12,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-02-15 00:56:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 301 proven. 103 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-02-15 00:56:12,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:56:12,328 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2022-02-15 00:56:12,330 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2022-02-15 00:56:14,337 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_207 Int) (v_arrayElimCell_206 Int)) (not (= 8529 (select (select (store |c_#memory_int| v_arrayElimCell_206 (store (select |c_#memory_int| v_arrayElimCell_206) (+ v_arrayElimCell_207 844) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset))))) is different from false [2022-02-15 00:56:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2022-02-15 00:56:14,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551095567] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-15 00:56:14,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-15 00:56:14,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 10] total 14 [2022-02-15 00:56:14,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218252568] [2022-02-15 00:56:14,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:56:14,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 00:56:14,522 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:56:14,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 00:56:14,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-02-15 00:56:14,522 INFO L87 Difference]: Start difference. First operand 16806 states and 23990 transitions. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:56:16,441 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_207 Int) (v_arrayElimCell_206 Int)) (not (= 8529 (select (select (store |c_#memory_int| v_arrayElimCell_206 (store (select |c_#memory_int| v_arrayElimCell_206) (+ v_arrayElimCell_207 844) 8640)) c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset))))) (not (= (select (select |c_#memory_int| c_ssl3_accept_~s.base) (+ 52 c_ssl3_accept_~s.offset)) 8529))) is different from false [2022-02-15 00:56:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:56:16,497 INFO L93 Difference]: Finished difference Result 18102 states and 25682 transitions. [2022-02-15 00:56:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 00:56:16,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 269 [2022-02-15 00:56:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:56:16,517 INFO L225 Difference]: With dead ends: 18102 [2022-02-15 00:56:16,517 INFO L226 Difference]: Without dead ends: 18102 [2022-02-15 00:56:16,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 536 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=42, Invalid=146, Unknown=2, NotChecked=50, Total=240 [2022-02-15 00:56:16,517 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 115 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-15 00:56:16,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 479 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 237 Invalid, 0 Unknown, 199 Unchecked, 0.8s Time] [2022-02-15 00:56:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18102 states. [2022-02-15 00:56:16,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18102 to 16530. [2022-02-15 00:56:16,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16530 states, 16525 states have (on average 1.4280786686838125) internal successors, (23599), 16525 states have internal predecessors, (23599), 3 states have call successors, (3), 3 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:56:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16530 states to 16530 states and 23603 transitions. [2022-02-15 00:56:16,688 INFO L78 Accepts]: Start accepts. Automaton has 16530 states and 23603 transitions. Word has length 269 [2022-02-15 00:56:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:56:16,688 INFO L470 AbstractCegarLoop]: Abstraction has 16530 states and 23603 transitions. [2022-02-15 00:56:16,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:56:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16530 states and 23603 transitions. [2022-02-15 00:56:16,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-02-15 00:56:16,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:56:16,700 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:16,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-15 00:56:16,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:56:16,900 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:56:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:56:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 23780713, now seen corresponding path program 1 times [2022-02-15 00:56:16,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:56:16,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002571460] [2022-02-15 00:56:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:56:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:56:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:56:17,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:56:17,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:56:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-02-15 00:56:17,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:56:17,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002571460] [2022-02-15 00:56:17,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002571460] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 00:56:17,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 00:56:17,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 00:56:17,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754816730] [2022-02-15 00:56:17,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 00:56:17,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 00:56:17,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:56:17,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 00:56:17,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 00:56:17,163 INFO L87 Difference]: Start difference. First operand 16530 states and 23603 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 2 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:56:19,176 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:56:21,207 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:56:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 00:56:21,718 INFO L93 Difference]: Finished difference Result 28251 states and 39923 transitions. [2022-02-15 00:56:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 00:56:21,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 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 269 [2022-02-15 00:56:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 00:56:21,745 INFO L225 Difference]: With dead ends: 28251 [2022-02-15 00:56:21,745 INFO L226 Difference]: Without dead ends: 28251 [2022-02-15 00:56:21,745 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:56:21,745 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 146 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-02-15 00:56:21,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 611 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 409 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2022-02-15 00:56:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28251 states. [2022-02-15 00:56:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28251 to 27221. [2022-02-15 00:56:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27221 states, 27216 states have (on average 1.408913874191652) internal successors, (38345), 27216 states have internal predecessors, (38345), 3 states have call successors, (3), 3 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:56:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27221 states to 27221 states and 38349 transitions. [2022-02-15 00:56:21,981 INFO L78 Accepts]: Start accepts. Automaton has 27221 states and 38349 transitions. Word has length 269 [2022-02-15 00:56:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 00:56:21,981 INFO L470 AbstractCegarLoop]: Abstraction has 27221 states and 38349 transitions. [2022-02-15 00:56:21,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (3), 2 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:56:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 27221 states and 38349 transitions. [2022-02-15 00:56:22,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2022-02-15 00:56:22,004 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 00:56:22,004 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:22,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-02-15 00:56:22,004 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 00:56:22,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 00:56:22,005 INFO L85 PathProgramCache]: Analyzing trace with hash 946466904, now seen corresponding path program 1 times [2022-02-15 00:56:22,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-15 00:56:22,005 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438753801] [2022-02-15 00:56:22,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:56:22,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 00:56:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:56:23,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 00:56:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:56:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 458 proven. 186 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-02-15 00:56:23,584 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-15 00:56:23,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438753801] [2022-02-15 00:56:23,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438753801] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-15 00:56:23,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032561119] [2022-02-15 00:56:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 00:56:23,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-15 00:56:23,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 00:56:23,585 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-15 00:56:23,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-15 00:56:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 00:56:25,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 1617 conjuncts, 103 conjunts are in the unsatisfiable core [2022-02-15 00:56:25,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-15 00:56:25,445 INFO L353 Elim1Store]: treesize reduction 73, result has 37.1 percent of original size [2022-02-15 00:56:25,445 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 120 [2022-02-15 00:56:25,472 INFO L353 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2022-02-15 00:56:25,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 216 [2022-02-15 00:56:25,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:25,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 155 [2022-02-15 00:56:25,490 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-15 00:56:25,490 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 44 [2022-02-15 00:56:25,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:25,536 INFO L353 Elim1Store]: treesize reduction 56, result has 49.5 percent of original size [2022-02-15 00:56:25,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 84 [2022-02-15 00:56:25,543 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-02-15 00:56:25,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2022-02-15 00:56:25,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-02-15 00:56:25,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:25,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2022-02-15 00:56:25,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:25,626 INFO L353 Elim1Store]: treesize reduction 46, result has 40.3 percent of original size [2022-02-15 00:56:25,627 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 60 [2022-02-15 00:56:25,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:25,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-02-15 00:56:25,715 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-02-15 00:56:25,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:25,727 INFO L353 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-02-15 00:56:25,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-02-15 00:56:25,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-02-15 00:56:25,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:25,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-02-15 00:56:25,838 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-02-15 00:56:25,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:25,849 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2022-02-15 00:56:25,873 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-15 00:56:26,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-02-15 00:56:26,264 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-02-15 00:56:26,276 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-02-15 00:56:26,290 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-02-15 00:56:26,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:26,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2022-02-15 00:56:27,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 98 [2022-02-15 00:56:27,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,242 INFO L353 Elim1Store]: treesize reduction 69, result has 28.1 percent of original size [2022-02-15 00:56:27,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 110 [2022-02-15 00:56:27,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 92 [2022-02-15 00:56:27,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,386 INFO L353 Elim1Store]: treesize reduction 69, result has 28.1 percent of original size [2022-02-15 00:56:27,386 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 125 [2022-02-15 00:56:27,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 116 [2022-02-15 00:56:27,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 113 [2022-02-15 00:56:27,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 152 [2022-02-15 00:56:27,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,547 INFO L353 Elim1Store]: treesize reduction 168, result has 34.6 percent of original size [2022-02-15 00:56:27,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 159 treesize of output 180 [2022-02-15 00:56:27,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:27,554 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 127 [2022-02-15 00:56:30,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:30,047 INFO L353 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2022-02-15 00:56:30,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 231 treesize of output 169 [2022-02-15 00:56:30,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:30,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2022-02-15 00:56:30,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:30,256 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-02-15 00:56:30,273 INFO L353 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2022-02-15 00:56:30,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 96 [2022-02-15 00:56:30,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2022-02-15 00:56:30,284 INFO L353 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2022-02-15 00:56:30,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 67 [2022-02-15 00:56:30,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:30,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 64 [2022-02-15 00:56:30,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:30,322 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2022-02-15 00:56:30,335 INFO L353 Elim1Store]: treesize reduction 49, result has 46.7 percent of original size [2022-02-15 00:56:30,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 56 [2022-02-15 00:56:31,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,043 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 74 [2022-02-15 00:56:31,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2022-02-15 00:56:31,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,075 INFO L353 Elim1Store]: treesize reduction 77, result has 35.8 percent of original size [2022-02-15 00:56:31,075 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 90 [2022-02-15 00:56:31,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 89 [2022-02-15 00:56:31,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 95 [2022-02-15 00:56:31,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,221 INFO L353 Elim1Store]: treesize reduction 77, result has 35.8 percent of original size [2022-02-15 00:56:31,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 111 [2022-02-15 00:56:31,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 102 [2022-02-15 00:56:31,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,338 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 84 [2022-02-15 00:56:31,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:31,353 INFO L353 Elim1Store]: treesize reduction 97, result has 13.4 percent of original size [2022-02-15 00:56:31,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 83 [2022-02-15 00:56:33,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:33,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:33,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-15 00:56:33,354 INFO L353 Elim1Store]: treesize reduction 26, result has 61.2 percent of original size [2022-02-15 00:56:33,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 87 [2022-02-15 00:56:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 371 proven. 153 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-02-15 00:56:33,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-15 00:56:33,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 314 [2022-02-15 00:58:10,136 INFO L353 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2022-02-15 00:58:10,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 10284 treesize of output 1 [2022-02-15 00:58:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 371 proven. 153 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-02-15 00:58:10,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032561119] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-15 00:58:10,233 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-15 00:58:10,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 12] total 38 [2022-02-15 00:58:10,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777184371] [2022-02-15 00:58:10,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-15 00:58:10,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-15 00:58:10,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-15 00:58:10,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-15 00:58:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1238, Unknown=1, NotChecked=0, Total=1406 [2022-02-15 00:58:10,239 INFO L87 Difference]: Start difference. First operand 27221 states and 38349 transitions. Second operand has 38 states, 38 states have (on average 15.473684210526315) internal successors, (588), 36 states have internal predecessors, (588), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 00:58:11,746 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:58:13,766 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:58:16,769 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:58:18,803 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:58:22,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:58:24,225 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:58:26,253 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:58:28,280 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:58:30,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-15 00:58:32,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []