java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:55,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:55,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:55,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:55,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:55,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:55,636 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:55,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:55,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:55,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:55,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:55,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:55,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:55,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:55,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:55,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:55,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:55,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:55,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:55,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:55,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:55,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:55,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:55,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:55,665 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:55,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:55,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:55,666 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:55,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:55,667 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:55,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:55,668 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:55,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:55,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:55,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:55,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:55,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:55,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:55,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:55,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:55,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:55,674 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:04:55,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:55,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:55,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:55,699 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:55,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:55,700 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:55,700 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:55,700 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:55,700 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:55,701 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:55,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:55,702 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:55,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:55,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:55,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:55,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:55,703 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:55,703 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:55,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:55,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:55,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:55,704 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:55,704 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:55,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:55,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:55,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:55,705 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:55,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:55,705 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:55,705 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:55,737 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:55,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:55,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:55,756 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:55,757 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:55,758 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-2.c [2019-09-16 17:04:55,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd6c093d/766da1e986a844be815004d906031ea9/FLAGd68169dfd [2019-09-16 17:04:56,458 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:56,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_clnt.blast.03.i.cil-2.c [2019-09-16 17:04:56,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd6c093d/766da1e986a844be815004d906031ea9/FLAGd68169dfd [2019-09-16 17:04:56,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fd6c093d/766da1e986a844be815004d906031ea9 [2019-09-16 17:04:56,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:56,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:56,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:56,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:56,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:56,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:56" (1/1) ... [2019-09-16 17:04:56,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3783fa7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:56, skipping insertion in model container [2019-09-16 17:04:56,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:56" (1/1) ... [2019-09-16 17:04:56,732 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:56,797 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:57,379 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:57,399 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:57,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:57,621 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:57,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57 WrapperNode [2019-09-16 17:04:57,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:57,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:57,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:57,623 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:57,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57" (1/1) ... [2019-09-16 17:04:57,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57" (1/1) ... [2019-09-16 17:04:57,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57" (1/1) ... [2019-09-16 17:04:57,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57" (1/1) ... [2019-09-16 17:04:57,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57" (1/1) ... [2019-09-16 17:04:57,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57" (1/1) ... [2019-09-16 17:04:57,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57" (1/1) ... [2019-09-16 17:04:57,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:57,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:57,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:57,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:57,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:57,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:57,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:57,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_client_method [2019-09-16 17:04:57,913 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_client_method [2019-09-16 17:04:57,913 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:57,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 17:04:57,913 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-16 17:04:57,914 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-16 17:04:57,914 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-16 17:04:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 17:04:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:04:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:04:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-16 17:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_client_method [2019-09-16 17:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-16 17:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 17:04:57,917 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_client_method [2019-09-16 17:04:57,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-16 17:04:57,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:04:57,918 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:57,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 17:04:57,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:04:57,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:04:57,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:04:57,919 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 17:04:57,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-16 17:04:57,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:57,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:04:57,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:04:57,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:04:57,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:57,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-16 17:04:57,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-16 17:04:57,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-16 17:04:57,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-16 17:04:57,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:04:58,611 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:59,373 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 17:04:59,373 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 17:04:59,399 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:59,399 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:59,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:59 BoogieIcfgContainer [2019-09-16 17:04:59,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:59,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:59,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:59,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:59,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:56" (1/3) ... [2019-09-16 17:04:59,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7ed0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:59, skipping insertion in model container [2019-09-16 17:04:59,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:57" (2/3) ... [2019-09-16 17:04:59,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7ed0f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:59, skipping insertion in model container [2019-09-16 17:04:59,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:59" (3/3) ... [2019-09-16 17:04:59,409 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.03.i.cil-2.c [2019-09-16 17:04:59,419 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:59,429 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:59,445 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:59,475 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:59,476 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:59,476 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:59,476 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:59,476 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:59,476 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:59,476 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:59,477 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states. [2019-09-16 17:04:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-16 17:04:59,511 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:59,512 INFO L407 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] [2019-09-16 17:04:59,515 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:59,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:59,520 INFO L82 PathProgramCache]: Analyzing trace with hash 461476132, now seen corresponding path program 1 times [2019-09-16 17:04:59,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:59,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:59,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:59,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:59,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:59,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:59,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:59,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:59,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:59,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:59,922 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 3 states. [2019-09-16 17:05:00,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,009 INFO L93 Difference]: Finished difference Result 254 states and 414 transitions. [2019-09-16 17:05:00,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:00,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-16 17:05:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,025 INFO L225 Difference]: With dead ends: 254 [2019-09-16 17:05:00,025 INFO L226 Difference]: Without dead ends: 219 [2019-09-16 17:05:00,027 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-16 17:05:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-09-16 17:05:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-16 17:05:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 323 transitions. [2019-09-16 17:05:00,083 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 323 transitions. Word has length 30 [2019-09-16 17:05:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,084 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 323 transitions. [2019-09-16 17:05:00,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 323 transitions. [2019-09-16 17:05:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 17:05:00,087 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,087 INFO L407 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] [2019-09-16 17:05:00,088 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash -147745042, now seen corresponding path program 1 times [2019-09-16 17:05:00,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:00,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:05:00,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:00,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:00,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:00,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:00,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:00,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:00,259 INFO L87 Difference]: Start difference. First operand 219 states and 323 transitions. Second operand 3 states. [2019-09-16 17:05:00,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:00,329 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-16 17:05:00,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:00,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-09-16 17:05:00,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:00,333 INFO L225 Difference]: With dead ends: 318 [2019-09-16 17:05:00,333 INFO L226 Difference]: Without dead ends: 318 [2019-09-16 17:05:00,335 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-16 17:05:00,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-09-16 17:05:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-16 17:05:00,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 469 transitions. [2019-09-16 17:05:00,374 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 469 transitions. Word has length 45 [2019-09-16 17:05:00,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:00,377 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 469 transitions. [2019-09-16 17:05:00,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 469 transitions. [2019-09-16 17:05:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:05:00,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:00,382 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:05:00,383 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:00,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:00,383 INFO L82 PathProgramCache]: Analyzing trace with hash -592195955, now seen corresponding path program 1 times [2019-09-16 17:05:00,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:00,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:00,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:00,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:00,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:00,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:00,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:00,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:00,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:00,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:00,528 INFO L87 Difference]: Start difference. First operand 318 states and 469 transitions. Second operand 4 states. [2019-09-16 17:05:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,158 INFO L93 Difference]: Finished difference Result 504 states and 746 transitions. [2019-09-16 17:05:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:05:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,163 INFO L225 Difference]: With dead ends: 504 [2019-09-16 17:05:01,163 INFO L226 Difference]: Without dead ends: 504 [2019-09-16 17:05:01,163 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:01,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-16 17:05:01,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 368. [2019-09-16 17:05:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-16 17:05:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 555 transitions. [2019-09-16 17:05:01,205 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 555 transitions. Word has length 63 [2019-09-16 17:05:01,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,206 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 555 transitions. [2019-09-16 17:05:01,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 555 transitions. [2019-09-16 17:05:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-16 17:05:01,210 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,210 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:05:01,211 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash -726209461, now seen corresponding path program 1 times [2019-09-16 17:05:01,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,355 INFO L87 Difference]: Start difference. First operand 368 states and 555 transitions. Second operand 4 states. [2019-09-16 17:05:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:01,697 INFO L93 Difference]: Finished difference Result 454 states and 681 transitions. [2019-09-16 17:05:01,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:01,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-16 17:05:01,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:01,703 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:01,703 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:01,704 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 408. [2019-09-16 17:05:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-16 17:05:01,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 623 transitions. [2019-09-16 17:05:01,722 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 623 transitions. Word has length 63 [2019-09-16 17:05:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:01,724 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 623 transitions. [2019-09-16 17:05:01,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 623 transitions. [2019-09-16 17:05:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-16 17:05:01,733 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:01,734 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:05:01,734 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:01,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1182891182, now seen corresponding path program 1 times [2019-09-16 17:05:01,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:01,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:01,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:01,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:01,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:01,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:01,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:01,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:01,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:01,865 INFO L87 Difference]: Start difference. First operand 408 states and 623 transitions. Second operand 4 states. [2019-09-16 17:05:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,341 INFO L93 Difference]: Finished difference Result 536 states and 804 transitions. [2019-09-16 17:05:02,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:02,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-16 17:05:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,351 INFO L225 Difference]: With dead ends: 536 [2019-09-16 17:05:02,351 INFO L226 Difference]: Without dead ends: 536 [2019-09-16 17:05:02,352 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-16 17:05:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 410. [2019-09-16 17:05:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 625 transitions. [2019-09-16 17:05:02,365 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 625 transitions. Word has length 64 [2019-09-16 17:05:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,365 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 625 transitions. [2019-09-16 17:05:02,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 625 transitions. [2019-09-16 17:05:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:02,367 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,368 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:02,368 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1433744923, now seen corresponding path program 1 times [2019-09-16 17:05:02,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:02,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:02,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:02,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:02,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:02,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:02,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:02,489 INFO L87 Difference]: Start difference. First operand 410 states and 625 transitions. Second operand 4 states. [2019-09-16 17:05:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:02,918 INFO L93 Difference]: Finished difference Result 534 states and 800 transitions. [2019-09-16 17:05:02,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:02,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:02,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:02,923 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:02,923 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:02,923 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:02,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 623 transitions. [2019-09-16 17:05:02,935 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 623 transitions. Word has length 77 [2019-09-16 17:05:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:02,935 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 623 transitions. [2019-09-16 17:05:02,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 623 transitions. [2019-09-16 17:05:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:02,937 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:02,937 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2019-09-16 17:05:02,937 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:02,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1752241927, now seen corresponding path program 1 times [2019-09-16 17:05:02,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:02,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:02,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:02,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,031 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:03,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,033 INFO L87 Difference]: Start difference. First operand 410 states and 623 transitions. Second operand 4 states. [2019-09-16 17:05:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,456 INFO L93 Difference]: Finished difference Result 534 states and 798 transitions. [2019-09-16 17:05:03,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:03,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,459 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:03,460 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:03,460 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 621 transitions. [2019-09-16 17:05:03,470 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 621 transitions. Word has length 77 [2019-09-16 17:05:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,471 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 621 transitions. [2019-09-16 17:05:03,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 621 transitions. [2019-09-16 17:05:03,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:03,472 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,472 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:05:03,473 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1831863075, now seen corresponding path program 1 times [2019-09-16 17:05:03,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:03,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,548 INFO L87 Difference]: Start difference. First operand 410 states and 621 transitions. Second operand 4 states. [2019-09-16 17:05:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:03,882 INFO L93 Difference]: Finished difference Result 454 states and 675 transitions. [2019-09-16 17:05:03,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:03,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:03,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:03,886 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:03,886 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:03,886 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 619 transitions. [2019-09-16 17:05:03,896 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 619 transitions. Word has length 77 [2019-09-16 17:05:03,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:03,896 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 619 transitions. [2019-09-16 17:05:03,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 619 transitions. [2019-09-16 17:05:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-16 17:05:03,898 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:03,898 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2019-09-16 17:05:03,898 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:03,899 INFO L82 PathProgramCache]: Analyzing trace with hash 722882629, now seen corresponding path program 1 times [2019-09-16 17:05:03,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:03,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:03,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:03,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:03,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:03,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:03,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:03,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:03,969 INFO L87 Difference]: Start difference. First operand 410 states and 619 transitions. Second operand 4 states. [2019-09-16 17:05:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,325 INFO L93 Difference]: Finished difference Result 454 states and 673 transitions. [2019-09-16 17:05:04,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-09-16 17:05:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,329 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:04,330 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:04,330 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 617 transitions. [2019-09-16 17:05:04,343 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 617 transitions. Word has length 77 [2019-09-16 17:05:04,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,344 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 617 transitions. [2019-09-16 17:05:04,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 617 transitions. [2019-09-16 17:05:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:04,350 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,350 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:05:04,351 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1460682036, now seen corresponding path program 1 times [2019-09-16 17:05:04,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,432 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:04,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,435 INFO L87 Difference]: Start difference. First operand 410 states and 617 transitions. Second operand 4 states. [2019-09-16 17:05:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:04,870 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2019-09-16 17:05:04,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:04,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:04,873 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:04,874 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:04,874 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 615 transitions. [2019-09-16 17:05:04,883 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 615 transitions. Word has length 78 [2019-09-16 17:05:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:04,883 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 615 transitions. [2019-09-16 17:05:04,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 615 transitions. [2019-09-16 17:05:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:04,885 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:04,885 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:05:04,885 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:04,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1160620953, now seen corresponding path program 1 times [2019-09-16 17:05:04,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:04,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:04,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:04,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:04,955 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:04,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:04,956 INFO L87 Difference]: Start difference. First operand 410 states and 615 transitions. Second operand 4 states. [2019-09-16 17:05:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,402 INFO L93 Difference]: Finished difference Result 534 states and 790 transitions. [2019-09-16 17:05:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,406 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:05,406 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:05,408 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:05,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 613 transitions. [2019-09-16 17:05:05,420 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 613 transitions. Word has length 78 [2019-09-16 17:05:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,420 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 613 transitions. [2019-09-16 17:05:05,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 613 transitions. [2019-09-16 17:05:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:05,422 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,423 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:05:05,423 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,423 INFO L82 PathProgramCache]: Analyzing trace with hash 988918094, now seen corresponding path program 1 times [2019-09-16 17:05:05,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,538 INFO L87 Difference]: Start difference. First operand 410 states and 613 transitions. Second operand 4 states. [2019-09-16 17:05:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:05,830 INFO L93 Difference]: Finished difference Result 454 states and 667 transitions. [2019-09-16 17:05:05,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:05,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:05,833 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:05,833 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:05,833 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 611 transitions. [2019-09-16 17:05:05,845 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 611 transitions. Word has length 78 [2019-09-16 17:05:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:05,846 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 611 transitions. [2019-09-16 17:05:05,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 611 transitions. [2019-09-16 17:05:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 17:05:05,847 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:05,847 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:05:05,848 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:05,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:05,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1288979177, now seen corresponding path program 1 times [2019-09-16 17:05:05,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:05,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:05,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:05,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:05,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:05,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:05,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:05,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:05,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:05,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:05,928 INFO L87 Difference]: Start difference. First operand 410 states and 611 transitions. Second operand 4 states. [2019-09-16 17:05:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,228 INFO L93 Difference]: Finished difference Result 454 states and 665 transitions. [2019-09-16 17:05:06,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 17:05:06,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,231 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:06,232 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:06,232 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:06,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 609 transitions. [2019-09-16 17:05:06,242 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 609 transitions. Word has length 78 [2019-09-16 17:05:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,242 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 609 transitions. [2019-09-16 17:05:06,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 609 transitions. [2019-09-16 17:05:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:06,244 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,244 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-09-16 17:05:06,244 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2074470850, now seen corresponding path program 1 times [2019-09-16 17:05:06,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:06,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,314 INFO L87 Difference]: Start difference. First operand 410 states and 609 transitions. Second operand 4 states. [2019-09-16 17:05:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:06,804 INFO L93 Difference]: Finished difference Result 534 states and 784 transitions. [2019-09-16 17:05:06,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:06,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:06,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:06,808 INFO L225 Difference]: With dead ends: 534 [2019-09-16 17:05:06,808 INFO L226 Difference]: Without dead ends: 534 [2019-09-16 17:05:06,808 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-16 17:05:06,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 410. [2019-09-16 17:05:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 607 transitions. [2019-09-16 17:05:06,818 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 607 transitions. Word has length 79 [2019-09-16 17:05:06,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:06,818 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 607 transitions. [2019-09-16 17:05:06,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 607 transitions. [2019-09-16 17:05:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:06,820 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:06,820 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:05:06,820 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash 784493186, now seen corresponding path program 1 times [2019-09-16 17:05:06,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:06,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:06,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:06,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:06,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:06,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:06,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:06,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:06,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:06,881 INFO L87 Difference]: Start difference. First operand 410 states and 607 transitions. Second operand 4 states. [2019-09-16 17:05:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,397 INFO L93 Difference]: Finished difference Result 528 states and 775 transitions. [2019-09-16 17:05:07,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:07,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,400 INFO L225 Difference]: With dead ends: 528 [2019-09-16 17:05:07,400 INFO L226 Difference]: Without dead ends: 528 [2019-09-16 17:05:07,402 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-16 17:05:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 410. [2019-09-16 17:05:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 605 transitions. [2019-09-16 17:05:07,411 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 605 transitions. Word has length 79 [2019-09-16 17:05:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,412 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 605 transitions. [2019-09-16 17:05:07,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 605 transitions. [2019-09-16 17:05:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:07,413 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,413 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2019-09-16 17:05:07,415 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash 702663552, now seen corresponding path program 1 times [2019-09-16 17:05:07,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:07,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:07,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:07,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:07,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:07,489 INFO L87 Difference]: Start difference. First operand 410 states and 605 transitions. Second operand 4 states. [2019-09-16 17:05:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:07,755 INFO L93 Difference]: Finished difference Result 454 states and 659 transitions. [2019-09-16 17:05:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:07,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:07,759 INFO L225 Difference]: With dead ends: 454 [2019-09-16 17:05:07,759 INFO L226 Difference]: Without dead ends: 454 [2019-09-16 17:05:07,760 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:07,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-16 17:05:07,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 410. [2019-09-16 17:05:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 603 transitions. [2019-09-16 17:05:07,770 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 603 transitions. Word has length 79 [2019-09-16 17:05:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:07,771 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 603 transitions. [2019-09-16 17:05:07,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 603 transitions. [2019-09-16 17:05:07,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 17:05:07,773 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:07,773 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:05:07,773 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:07,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:07,774 INFO L82 PathProgramCache]: Analyzing trace with hash -587314112, now seen corresponding path program 1 times [2019-09-16 17:05:07,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:07,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:07,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:07,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:07,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:07,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:07,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:07,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:07,843 INFO L87 Difference]: Start difference. First operand 410 states and 603 transitions. Second operand 4 states. [2019-09-16 17:05:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,112 INFO L93 Difference]: Finished difference Result 448 states and 650 transitions. [2019-09-16 17:05:08,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 17:05:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,115 INFO L225 Difference]: With dead ends: 448 [2019-09-16 17:05:08,116 INFO L226 Difference]: Without dead ends: 448 [2019-09-16 17:05:08,116 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-16 17:05:08,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 410. [2019-09-16 17:05:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 601 transitions. [2019-09-16 17:05:08,126 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 601 transitions. Word has length 79 [2019-09-16 17:05:08,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,126 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 601 transitions. [2019-09-16 17:05:08,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 601 transitions. [2019-09-16 17:05:08,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:08,128 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,128 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:05:08,128 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,128 INFO L82 PathProgramCache]: Analyzing trace with hash 51641255, now seen corresponding path program 1 times [2019-09-16 17:05:08,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:08,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:08,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:08,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:08,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:08,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:08,192 INFO L87 Difference]: Start difference. First operand 410 states and 601 transitions. Second operand 4 states. [2019-09-16 17:05:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,545 INFO L93 Difference]: Finished difference Result 510 states and 747 transitions. [2019-09-16 17:05:08,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:08,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,549 INFO L225 Difference]: With dead ends: 510 [2019-09-16 17:05:08,549 INFO L226 Difference]: Without dead ends: 510 [2019-09-16 17:05:08,549 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-16 17:05:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-16 17:05:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 599 transitions. [2019-09-16 17:05:08,558 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 599 transitions. Word has length 80 [2019-09-16 17:05:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,559 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 599 transitions. [2019-09-16 17:05:08,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 599 transitions. [2019-09-16 17:05:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 17:05:08,560 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,560 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:05:08,561 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,561 INFO L82 PathProgramCache]: Analyzing trace with hash 475287977, now seen corresponding path program 1 times [2019-09-16 17:05:08,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:08,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:08,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:08,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:08,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:08,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:08,637 INFO L87 Difference]: Start difference. First operand 410 states and 599 transitions. Second operand 4 states. [2019-09-16 17:05:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:08,907 INFO L93 Difference]: Finished difference Result 430 states and 624 transitions. [2019-09-16 17:05:08,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:08,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-16 17:05:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:08,910 INFO L225 Difference]: With dead ends: 430 [2019-09-16 17:05:08,910 INFO L226 Difference]: Without dead ends: 430 [2019-09-16 17:05:08,911 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-09-16 17:05:08,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 410. [2019-09-16 17:05:08,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2019-09-16 17:05:08,921 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 80 [2019-09-16 17:05:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:08,922 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2019-09-16 17:05:08,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2019-09-16 17:05:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:08,923 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:08,924 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:05:08,924 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash 643036702, now seen corresponding path program 1 times [2019-09-16 17:05:08,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:08,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:08,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:05:09,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:09,028 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:09,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:09,029 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand 4 states. [2019-09-16 17:05:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,444 INFO L93 Difference]: Finished difference Result 510 states and 743 transitions. [2019-09-16 17:05:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:09,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-16 17:05:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,448 INFO L225 Difference]: With dead ends: 510 [2019-09-16 17:05:09,448 INFO L226 Difference]: Without dead ends: 510 [2019-09-16 17:05:09,448 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-16 17:05:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 410. [2019-09-16 17:05:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-16 17:05:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 595 transitions. [2019-09-16 17:05:09,458 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 595 transitions. Word has length 81 [2019-09-16 17:05:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:09,458 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 595 transitions. [2019-09-16 17:05:09,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 595 transitions. [2019-09-16 17:05:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 17:05:09,460 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:09,460 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:05:09,460 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:09,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:09,460 INFO L82 PathProgramCache]: Analyzing trace with hash 891183196, now seen corresponding path program 1 times [2019-09-16 17:05:09,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:09,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:09,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-16 17:05:09,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:09,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:09,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:09,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:09,536 INFO L87 Difference]: Start difference. First operand 410 states and 595 transitions. Second operand 3 states. [2019-09-16 17:05:09,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,567 INFO L93 Difference]: Finished difference Result 559 states and 812 transitions. [2019-09-16 17:05:09,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:09,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-16 17:05:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,571 INFO L225 Difference]: With dead ends: 559 [2019-09-16 17:05:09,571 INFO L226 Difference]: Without dead ends: 559 [2019-09-16 17:05:09,571 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:09,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-09-16 17:05:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2019-09-16 17:05:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-16 17:05:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 812 transitions. [2019-09-16 17:05:09,587 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 812 transitions. Word has length 81 [2019-09-16 17:05:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:09,588 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 812 transitions. [2019-09-16 17:05:09,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 812 transitions. [2019-09-16 17:05:09,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-16 17:05:09,590 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:09,590 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2019-09-16 17:05:09,590 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:09,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash 363210002, now seen corresponding path program 1 times [2019-09-16 17:05:09,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:09,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:09,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-16 17:05:09,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:09,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:09,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:09,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:09,707 INFO L87 Difference]: Start difference. First operand 559 states and 812 transitions. Second operand 3 states. [2019-09-16 17:05:09,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,754 INFO L93 Difference]: Finished difference Result 708 states and 1030 transitions. [2019-09-16 17:05:09,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:09,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-09-16 17:05:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,765 INFO L225 Difference]: With dead ends: 708 [2019-09-16 17:05:09,765 INFO L226 Difference]: Without dead ends: 708 [2019-09-16 17:05:09,765 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-09-16 17:05:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 708. [2019-09-16 17:05:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-09-16 17:05:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1030 transitions. [2019-09-16 17:05:09,796 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1030 transitions. Word has length 83 [2019-09-16 17:05:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:09,796 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1030 transitions. [2019-09-16 17:05:09,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1030 transitions. [2019-09-16 17:05:09,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-16 17:05:09,799 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:09,799 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2019-09-16 17:05:09,800 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:09,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1857235727, now seen corresponding path program 1 times [2019-09-16 17:05:09,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:09,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:09,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-16 17:05:09,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:09,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:05:09,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:09,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:05:09,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:05:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:09,887 INFO L87 Difference]: Start difference. First operand 708 states and 1030 transitions. Second operand 3 states. [2019-09-16 17:05:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:09,934 INFO L93 Difference]: Finished difference Result 857 states and 1249 transitions. [2019-09-16 17:05:09,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:05:09,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-16 17:05:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:09,941 INFO L225 Difference]: With dead ends: 857 [2019-09-16 17:05:09,941 INFO L226 Difference]: Without dead ends: 857 [2019-09-16 17:05:09,942 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:05:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-09-16 17:05:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2019-09-16 17:05:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-09-16 17:05:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1249 transitions. [2019-09-16 17:05:09,967 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1249 transitions. Word has length 104 [2019-09-16 17:05:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:09,968 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 1249 transitions. [2019-09-16 17:05:09,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:05:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1249 transitions. [2019-09-16 17:05:09,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-16 17:05:09,971 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:09,972 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 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] [2019-09-16 17:05:09,972 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:09,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:09,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1155312928, now seen corresponding path program 1 times [2019-09-16 17:05:09,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:09,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:09,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-16 17:05:10,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,106 INFO L87 Difference]: Start difference. First operand 857 states and 1249 transitions. Second operand 4 states. [2019-09-16 17:05:10,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:10,532 INFO L93 Difference]: Finished difference Result 1401 states and 2067 transitions. [2019-09-16 17:05:10,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:10,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-09-16 17:05:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:10,540 INFO L225 Difference]: With dead ends: 1401 [2019-09-16 17:05:10,540 INFO L226 Difference]: Without dead ends: 1401 [2019-09-16 17:05:10,540 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2019-09-16 17:05:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 965. [2019-09-16 17:05:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-09-16 17:05:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1429 transitions. [2019-09-16 17:05:10,565 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1429 transitions. Word has length 141 [2019-09-16 17:05:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:10,565 INFO L475 AbstractCegarLoop]: Abstraction has 965 states and 1429 transitions. [2019-09-16 17:05:10,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1429 transitions. [2019-09-16 17:05:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:05:10,568 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:10,569 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 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] [2019-09-16 17:05:10,569 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1352173795, now seen corresponding path program 1 times [2019-09-16 17:05:10,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:10,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:10,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-16 17:05:10,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:10,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:10,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:10,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:10,679 INFO L87 Difference]: Start difference. First operand 965 states and 1429 transitions. Second operand 4 states. [2019-09-16 17:05:11,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:11,091 INFO L93 Difference]: Finished difference Result 1374 states and 2023 transitions. [2019-09-16 17:05:11,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:11,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-16 17:05:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:11,098 INFO L225 Difference]: With dead ends: 1374 [2019-09-16 17:05:11,098 INFO L226 Difference]: Without dead ends: 1374 [2019-09-16 17:05:11,099 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2019-09-16 17:05:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 971. [2019-09-16 17:05:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-16 17:05:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1435 transitions. [2019-09-16 17:05:11,124 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1435 transitions. Word has length 142 [2019-09-16 17:05:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:11,125 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1435 transitions. [2019-09-16 17:05:11,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1435 transitions. [2019-09-16 17:05:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:05:11,128 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:11,128 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2019-09-16 17:05:11,128 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:11,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:11,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1463416888, now seen corresponding path program 1 times [2019-09-16 17:05:11,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-16 17:05:11,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:11,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:11,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:11,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:11,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:11,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:11,240 INFO L87 Difference]: Start difference. First operand 971 states and 1435 transitions. Second operand 4 states. [2019-09-16 17:05:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:11,723 INFO L93 Difference]: Finished difference Result 1368 states and 2011 transitions. [2019-09-16 17:05:11,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:11,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:05:11,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:11,730 INFO L225 Difference]: With dead ends: 1368 [2019-09-16 17:05:11,731 INFO L226 Difference]: Without dead ends: 1368 [2019-09-16 17:05:11,731 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-16 17:05:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-16 17:05:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-16 17:05:11,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1429 transitions. [2019-09-16 17:05:11,755 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1429 transitions. Word has length 155 [2019-09-16 17:05:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:11,756 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1429 transitions. [2019-09-16 17:05:11,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1429 transitions. [2019-09-16 17:05:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-16 17:05:11,759 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:11,760 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2019-09-16 17:05:11,760 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:11,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2001426458, now seen corresponding path program 1 times [2019-09-16 17:05:11,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:11,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:11,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:11,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-16 17:05:11,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:11,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:11,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:11,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:11,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:11,932 INFO L87 Difference]: Start difference. First operand 971 states and 1429 transitions. Second operand 4 states. [2019-09-16 17:05:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:12,363 INFO L93 Difference]: Finished difference Result 1368 states and 2005 transitions. [2019-09-16 17:05:12,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:12,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-16 17:05:12,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:12,370 INFO L225 Difference]: With dead ends: 1368 [2019-09-16 17:05:12,370 INFO L226 Difference]: Without dead ends: 1368 [2019-09-16 17:05:12,370 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-16 17:05:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-16 17:05:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-16 17:05:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1423 transitions. [2019-09-16 17:05:12,401 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1423 transitions. Word has length 155 [2019-09-16 17:05:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:12,401 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1423 transitions. [2019-09-16 17:05:12,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1423 transitions. [2019-09-16 17:05:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:05:12,404 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:12,405 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2019-09-16 17:05:12,405 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:12,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1135265655, now seen corresponding path program 1 times [2019-09-16 17:05:12,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:12,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-16 17:05:12,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:12,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:12,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:12,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:12,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:12,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:12,523 INFO L87 Difference]: Start difference. First operand 971 states and 1423 transitions. Second operand 4 states. [2019-09-16 17:05:13,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:13,072 INFO L93 Difference]: Finished difference Result 1368 states and 1999 transitions. [2019-09-16 17:05:13,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:13,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:05:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:13,079 INFO L225 Difference]: With dead ends: 1368 [2019-09-16 17:05:13,079 INFO L226 Difference]: Without dead ends: 1368 [2019-09-16 17:05:13,080 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-16 17:05:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-16 17:05:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-16 17:05:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1417 transitions. [2019-09-16 17:05:13,106 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1417 transitions. Word has length 156 [2019-09-16 17:05:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:13,106 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1417 transitions. [2019-09-16 17:05:13,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1417 transitions. [2019-09-16 17:05:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-16 17:05:13,110 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:13,111 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 4, 4, 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] [2019-09-16 17:05:13,111 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:13,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1198398414, now seen corresponding path program 1 times [2019-09-16 17:05:13,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:13,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:13,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-16 17:05:13,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:13,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:13,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:13,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:13,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:13,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:13,208 INFO L87 Difference]: Start difference. First operand 971 states and 1417 transitions. Second operand 4 states. [2019-09-16 17:05:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:13,633 INFO L93 Difference]: Finished difference Result 1368 states and 1993 transitions. [2019-09-16 17:05:13,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:13,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-16 17:05:13,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:13,640 INFO L225 Difference]: With dead ends: 1368 [2019-09-16 17:05:13,640 INFO L226 Difference]: Without dead ends: 1368 [2019-09-16 17:05:13,641 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-16 17:05:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-16 17:05:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-16 17:05:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1411 transitions. [2019-09-16 17:05:13,673 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1411 transitions. Word has length 156 [2019-09-16 17:05:13,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:13,675 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1411 transitions. [2019-09-16 17:05:13,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1411 transitions. [2019-09-16 17:05:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:05:13,678 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:13,678 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2019-09-16 17:05:13,679 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1200498443, now seen corresponding path program 1 times [2019-09-16 17:05:13,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:13,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:13,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:13,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-16 17:05:13,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:13,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:13,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:13,767 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:13,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:13,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:13,768 INFO L87 Difference]: Start difference. First operand 971 states and 1411 transitions. Second operand 4 states. [2019-09-16 17:05:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:14,167 INFO L93 Difference]: Finished difference Result 1368 states and 1987 transitions. [2019-09-16 17:05:14,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:14,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:05:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:14,176 INFO L225 Difference]: With dead ends: 1368 [2019-09-16 17:05:14,176 INFO L226 Difference]: Without dead ends: 1368 [2019-09-16 17:05:14,177 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:14,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2019-09-16 17:05:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 971. [2019-09-16 17:05:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-16 17:05:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1405 transitions. [2019-09-16 17:05:14,207 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1405 transitions. Word has length 157 [2019-09-16 17:05:14,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:14,207 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1405 transitions. [2019-09-16 17:05:14,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1405 transitions. [2019-09-16 17:05:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-16 17:05:14,212 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:14,212 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 4, 4, 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] [2019-09-16 17:05:14,213 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:14,213 INFO L82 PathProgramCache]: Analyzing trace with hash -499704245, now seen corresponding path program 1 times [2019-09-16 17:05:14,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:14,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:14,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:14,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:14,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-16 17:05:14,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:14,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:14,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:14,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:14,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:14,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:14,343 INFO L87 Difference]: Start difference. First operand 971 states and 1405 transitions. Second operand 4 states. [2019-09-16 17:05:14,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:14,751 INFO L93 Difference]: Finished difference Result 1351 states and 1960 transitions. [2019-09-16 17:05:14,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:14,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-16 17:05:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:14,761 INFO L225 Difference]: With dead ends: 1351 [2019-09-16 17:05:14,761 INFO L226 Difference]: Without dead ends: 1351 [2019-09-16 17:05:14,761 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2019-09-16 17:05:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 971. [2019-09-16 17:05:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-16 17:05:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1399 transitions. [2019-09-16 17:05:14,784 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1399 transitions. Word has length 157 [2019-09-16 17:05:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:14,784 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1399 transitions. [2019-09-16 17:05:14,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1399 transitions. [2019-09-16 17:05:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-16 17:05:14,795 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:14,796 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 4, 4, 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] [2019-09-16 17:05:14,796 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:14,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:14,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1849324430, now seen corresponding path program 1 times [2019-09-16 17:05:14,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:14,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:14,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:14,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:14,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-16 17:05:14,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:05:14,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:05:14,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:14,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:14,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:14,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:05:14,918 INFO L87 Difference]: Start difference. First operand 971 states and 1399 transitions. Second operand 4 states. [2019-09-16 17:05:15,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:15,315 INFO L93 Difference]: Finished difference Result 1297 states and 1888 transitions. [2019-09-16 17:05:15,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:15,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-16 17:05:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:15,324 INFO L225 Difference]: With dead ends: 1297 [2019-09-16 17:05:15,324 INFO L226 Difference]: Without dead ends: 1297 [2019-09-16 17:05:15,326 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:05:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-09-16 17:05:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 971. [2019-09-16 17:05:15,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-09-16 17:05:15,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1393 transitions. [2019-09-16 17:05:15,351 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1393 transitions. Word has length 158 [2019-09-16 17:05:15,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:15,351 INFO L475 AbstractCegarLoop]: Abstraction has 971 states and 1393 transitions. [2019-09-16 17:05:15,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:15,352 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1393 transitions. [2019-09-16 17:05:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-16 17:05:15,357 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:15,357 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 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] [2019-09-16 17:05:15,358 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash -329495249, now seen corresponding path program 2 times [2019-09-16 17:05:15,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:15,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:15,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:05:15,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:15,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 234 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-16 17:05:15,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:05:15,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:05:15,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:05:15,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:05:15,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:05:15,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:05:15,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:05:15,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:05:15,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-16 17:05:15,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:05:15,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-16 17:05:15,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:05:15,872 INFO L341 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-09-16 17:05:15,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 18 treesize of output 19 [2019-09-16 17:05:15,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 17:05:15,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 17:05:15,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 17:05:15,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-09-16 17:05:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-09-16 17:05:15,949 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:05:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-09-16 17:05:16,072 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:05:16,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [6] total 11 [2019-09-16 17:05:16,072 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:16,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:05:16,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:05:16,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:05:16,073 INFO L87 Difference]: Start difference. First operand 971 states and 1393 transitions. Second operand 4 states. [2019-09-16 17:05:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:16,380 INFO L93 Difference]: Finished difference Result 1255 states and 1813 transitions. [2019-09-16 17:05:16,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:05:16,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-16 17:05:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:16,393 INFO L225 Difference]: With dead ends: 1255 [2019-09-16 17:05:16,393 INFO L226 Difference]: Without dead ends: 1255 [2019-09-16 17:05:16,394 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:05:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-09-16 17:05:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1103. [2019-09-16 17:05:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2019-09-16 17:05:16,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1621 transitions. [2019-09-16 17:05:16,429 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1621 transitions. Word has length 159 [2019-09-16 17:05:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:16,430 INFO L475 AbstractCegarLoop]: Abstraction has 1103 states and 1621 transitions. [2019-09-16 17:05:16,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:05:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1621 transitions. [2019-09-16 17:05:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-16 17:05:16,434 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:05:16,434 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 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] [2019-09-16 17:05:16,434 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:05:16,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:16,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1501655387, now seen corresponding path program 1 times [2019-09-16 17:05:16,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:05:16,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:16,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:05:16,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:05:16,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:05:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:05:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 234 proven. 4 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-09-16 17:05:16,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:05:16,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:05:16,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 163 with the following transitions: [2019-09-16 17:05:16,688 INFO L207 CegarAbsIntRunner]: [0], [38], [39], [40], [43], [52], [63], [72], [74], [79], [84], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [284], [287], [295], [298], [303], [306], [308], [311], [319], [322], [324], [326], [328], [331], [333], [336], [344], [346], [348], [351], [353], [359], [364], [366], [369], [523], [557], [559], [571], [590], [596], [597], [598] [2019-09-16 17:05:16,744 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:05:16,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:05:16,826 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:05:16,828 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-16 17:05:16,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:05:16,835 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:05:16,896 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-16 17:05:16,896 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:05:16,901 INFO L420 sIntCurrentIteration]: We unified 161 AI predicates to 161 [2019-09-16 17:05:16,901 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:05:16,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:05:16,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-16 17:05:16,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:05:16,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 17:05:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 17:05:16,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:05:16,904 INFO L87 Difference]: Start difference. First operand 1103 states and 1621 transitions. Second operand 2 states. [2019-09-16 17:05:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:05:16,904 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-16 17:05:16,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 17:05:16,905 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 162 [2019-09-16 17:05:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:05:16,905 INFO L225 Difference]: With dead ends: 2 [2019-09-16 17:05:16,905 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:05:16,905 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 17:05:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:05:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:05:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:05:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:05:16,906 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2019-09-16 17:05:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:05:16,907 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:05:16,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 17:05:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:05:16,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:05:16,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:05:16 BoogieIcfgContainer [2019-09-16 17:05:16,912 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:05:16,914 INFO L168 Benchmark]: Toolchain (without parser) took 20197.75 ms. Allocated memory was 138.9 MB in the beginning and 514.3 MB in the end (delta: 375.4 MB). Free memory was 84.6 MB in the beginning and 449.6 MB in the end (delta: -365.0 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:16,915 INFO L168 Benchmark]: CDTParser took 1.27 ms. Allocated memory is still 138.9 MB. Free memory is still 104.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-16 17:05:16,916 INFO L168 Benchmark]: CACSL2BoogieTranslator took 904.80 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 84.1 MB in the beginning and 158.5 MB in the end (delta: -74.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:16,916 INFO L168 Benchmark]: Boogie Preprocessor took 173.63 ms. Allocated memory is still 200.3 MB. Free memory was 158.5 MB in the beginning and 150.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:16,917 INFO L168 Benchmark]: RCFGBuilder took 1604.04 ms. Allocated memory was 200.3 MB in the beginning and 222.8 MB in the end (delta: 22.5 MB). Free memory was 150.9 MB in the beginning and 174.5 MB in the end (delta: -23.7 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:16,918 INFO L168 Benchmark]: TraceAbstraction took 17510.40 ms. Allocated memory was 222.8 MB in the beginning and 514.3 MB in the end (delta: 291.5 MB). Free memory was 174.5 MB in the beginning and 449.6 MB in the end (delta: -275.1 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:05:16,921 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.27 ms. Allocated memory is still 138.9 MB. Free memory is still 104.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 904.80 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 84.1 MB in the beginning and 158.5 MB in the end (delta: -74.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 173.63 ms. Allocated memory is still 200.3 MB. Free memory was 158.5 MB in the beginning and 150.9 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1604.04 ms. Allocated memory was 200.3 MB in the beginning and 222.8 MB in the end (delta: 22.5 MB). Free memory was 150.9 MB in the beginning and 174.5 MB in the end (delta: -23.7 MB). Peak memory consumption was 85.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17510.40 ms. Allocated memory was 222.8 MB in the beginning and 514.3 MB in the end (delta: 291.5 MB). Free memory was 174.5 MB in the beginning and 449.6 MB in the end (delta: -275.1 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1643]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 167 locations, 1 error locations. SAFE Result, 17.4s OverallTime, 34 OverallIterations, 8 TraceHistogramMax, 11.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7410 SDtfs, 2879 SDslu, 9493 SDs, 0 SdLazy, 5694 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 540 SyntacticMatches, 19 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1103occurred in iteration=33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.3726708074534162 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 5206 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3567 NumberOfCodeBlocks, 3456 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3690 ConstructedInterpolants, 0 QuantifiedInterpolants, 880145 SizeOfPredicates, 3 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 36 InterpolantComputations, 34 PerfectInterpolantSequences, 5434/5442 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...