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_srvr.blast.15.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:28:00,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:28:00,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:28:00,689 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:28:00,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:28:00,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:28:00,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:28:00,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:28:00,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:28:00,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:28:00,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:28:00,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:28:00,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:28:00,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:28:00,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:28:00,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:28:00,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:28:00,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:28:00,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:28:00,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:28:00,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:28:00,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:28:00,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:28:00,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:28:00,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:28:00,716 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:28:00,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:28:00,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:28:00,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:28:00,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:28:00,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:28:00,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:28:00,721 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:28:00,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:28:00,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:28:00,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:28:00,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:28:00,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:28:00,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:28:00,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:28:00,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:28:00,727 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-20 13:28:00,742 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:28:00,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:28:00,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:28:00,745 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:28:00,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:28:00,746 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:28:00,746 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:28:00,746 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:28:00,747 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:28:00,747 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:28:00,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:28:00,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:28:00,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:28:00,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:28:00,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:28:00,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:28:00,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:28:00,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:28:00,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:28:00,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:28:00,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:28:00,751 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:28:00,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:28:00,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:28:00,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:28:00,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:28:00,752 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:28:00,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:28:00,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:28:00,753 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:28:00,801 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:28:00,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:28:00,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:28:00,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:28:00,826 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:28:00,827 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15.i.cil-2.c [2019-09-20 13:28:00,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5c1ed9f/ae817e12ff684a5781999ee2ec6f9f06/FLAG620830fcb [2019-09-20 13:28:01,546 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:28:01,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.15.i.cil-2.c [2019-09-20 13:28:01,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5c1ed9f/ae817e12ff684a5781999ee2ec6f9f06/FLAG620830fcb [2019-09-20 13:28:01,764 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5c1ed9f/ae817e12ff684a5781999ee2ec6f9f06 [2019-09-20 13:28:01,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:28:01,775 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:28:01,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:01,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:28:01,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:28:01,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:01" (1/1) ... [2019-09-20 13:28:01,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3c048f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01, skipping insertion in model container [2019-09-20 13:28:01,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:01" (1/1) ... [2019-09-20 13:28:01,791 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:28:01,877 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:28:02,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:02,519 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:28:02,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:02,801 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:28:02,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02 WrapperNode [2019-09-20 13:28:02,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:02,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:28:02,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:28:02,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:28:02,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02" (1/1) ... [2019-09-20 13:28:02,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02" (1/1) ... [2019-09-20 13:28:02,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02" (1/1) ... [2019-09-20 13:28:02,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02" (1/1) ... [2019-09-20 13:28:02,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02" (1/1) ... [2019-09-20 13:28:02,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02" (1/1) ... [2019-09-20 13:28:02,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02" (1/1) ... [2019-09-20 13:28:03,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:28:03,012 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:28:03,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:28:03,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:28:03,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02" (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-20 13:28:03,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:28:03,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:28:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:28:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:28:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:28:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:28:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:28:03,080 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:28:03,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:28:03,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:28:03,081 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:28:03,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:28:03,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:28:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:28:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:28:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:28:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:28:03,082 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:28:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:28:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:28:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:28:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:28:03,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:28:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:28:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:28:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:28:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:28:03,084 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:28:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:28:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:28:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:28:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:28:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:28:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:28:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:28:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:28:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:28:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:28:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:28:03,513 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:28:04,313 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:28:04,314 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:28:04,340 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:28:04,340 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:28:04,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:04 BoogieIcfgContainer [2019-09-20 13:28:04,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:28:04,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:28:04,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:28:04,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:28:04,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:28:01" (1/3) ... [2019-09-20 13:28:04,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35301e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:04, skipping insertion in model container [2019-09-20 13:28:04,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:02" (2/3) ... [2019-09-20 13:28:04,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35301e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:04, skipping insertion in model container [2019-09-20 13:28:04,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:04" (3/3) ... [2019-09-20 13:28:04,350 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-2.c [2019-09-20 13:28:04,361 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:28:04,373 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:28:04,390 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:28:04,418 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:28:04,419 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:28:04,419 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:28:04,419 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:28:04,419 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:28:04,419 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:28:04,420 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:28:04,420 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:28:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states. [2019-09-20 13:28:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:28:04,453 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,457 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash -335853331, now seen corresponding path program 1 times [2019-09-20 13:28:04,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,850 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-20 13:28:04,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,879 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 4 states. [2019-09-20 13:28:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,399 INFO L93 Difference]: Finished difference Result 194 states and 318 transitions. [2019-09-20 13:28:05,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-09-20 13:28:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,416 INFO L225 Difference]: With dead ends: 194 [2019-09-20 13:28:05,416 INFO L226 Difference]: Without dead ends: 173 [2019-09-20 13:28:05,418 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-20 13:28:05,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-20 13:28:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2019-09-20 13:28:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-20 13:28:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 240 transitions. [2019-09-20 13:28:05,505 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 240 transitions. Word has length 50 [2019-09-20 13:28:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,506 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 240 transitions. [2019-09-20 13:28:05,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 240 transitions. [2019-09-20 13:28:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:05,516 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,516 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:05,516 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,517 INFO L82 PathProgramCache]: Analyzing trace with hash -900883004, now seen corresponding path program 1 times [2019-09-20 13:28:05,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,705 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-20 13:28:05,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,709 INFO L87 Difference]: Start difference. First operand 156 states and 240 transitions. Second operand 4 states. [2019-09-20 13:28:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,206 INFO L93 Difference]: Finished difference Result 173 states and 260 transitions. [2019-09-20 13:28:06,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,211 INFO L225 Difference]: With dead ends: 173 [2019-09-20 13:28:06,211 INFO L226 Difference]: Without dead ends: 173 [2019-09-20 13:28:06,215 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-20 13:28:06,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-20 13:28:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2019-09-20 13:28:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-20 13:28:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 239 transitions. [2019-09-20 13:28:06,239 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 239 transitions. Word has length 63 [2019-09-20 13:28:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,240 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 239 transitions. [2019-09-20 13:28:06,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 239 transitions. [2019-09-20 13:28:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:06,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,247 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:06,248 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1389647328, now seen corresponding path program 1 times [2019-09-20 13:28:06,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:06,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,401 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,403 INFO L87 Difference]: Start difference. First operand 156 states and 239 transitions. Second operand 4 states. [2019-09-20 13:28:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,739 INFO L93 Difference]: Finished difference Result 172 states and 258 transitions. [2019-09-20 13:28:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,741 INFO L225 Difference]: With dead ends: 172 [2019-09-20 13:28:06,742 INFO L226 Difference]: Without dead ends: 172 [2019-09-20 13:28:06,742 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-20 13:28:06,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-20 13:28:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 156. [2019-09-20 13:28:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-20 13:28:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2019-09-20 13:28:06,751 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 64 [2019-09-20 13:28:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,751 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2019-09-20 13:28:06,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2019-09-20 13:28:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:06,753 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,753 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:06,754 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,754 INFO L82 PathProgramCache]: Analyzing trace with hash -245888052, now seen corresponding path program 1 times [2019-09-20 13:28:06,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:06,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:06,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:06,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:06,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:06,852 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 5 states. [2019-09-20 13:28:07,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,375 INFO L93 Difference]: Finished difference Result 177 states and 266 transitions. [2019-09-20 13:28:07,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:28:07,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-09-20 13:28:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,377 INFO L225 Difference]: With dead ends: 177 [2019-09-20 13:28:07,377 INFO L226 Difference]: Without dead ends: 177 [2019-09-20 13:28:07,378 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:28:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-20 13:28:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-20 13:28:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-20 13:28:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 265 transitions. [2019-09-20 13:28:07,387 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 265 transitions. Word has length 64 [2019-09-20 13:28:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,388 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 265 transitions. [2019-09-20 13:28:07,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 265 transitions. [2019-09-20 13:28:07,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:07,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,395 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,395 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,395 INFO L82 PathProgramCache]: Analyzing trace with hash 2053945620, now seen corresponding path program 1 times [2019-09-20 13:28:07,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:07,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,521 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,524 INFO L87 Difference]: Start difference. First operand 176 states and 265 transitions. Second operand 4 states. [2019-09-20 13:28:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,800 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2019-09-20 13:28:07,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,802 INFO L225 Difference]: With dead ends: 191 [2019-09-20 13:28:07,803 INFO L226 Difference]: Without dead ends: 191 [2019-09-20 13:28:07,803 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-20 13:28:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-20 13:28:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 176. [2019-09-20 13:28:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-20 13:28:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 264 transitions. [2019-09-20 13:28:07,810 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 264 transitions. Word has length 64 [2019-09-20 13:28:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,811 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 264 transitions. [2019-09-20 13:28:07,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 264 transitions. [2019-09-20 13:28:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:07,812 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,812 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,812 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,813 INFO L82 PathProgramCache]: Analyzing trace with hash -40414411, now seen corresponding path program 1 times [2019-09-20 13:28:07,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:07,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,880 INFO L87 Difference]: Start difference. First operand 176 states and 264 transitions. Second operand 4 states. [2019-09-20 13:28:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,141 INFO L93 Difference]: Finished difference Result 189 states and 279 transitions. [2019-09-20 13:28:08,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:08,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,143 INFO L225 Difference]: With dead ends: 189 [2019-09-20 13:28:08,143 INFO L226 Difference]: Without dead ends: 189 [2019-09-20 13:28:08,144 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-20 13:28:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-20 13:28:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2019-09-20 13:28:08,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-20 13:28:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 263 transitions. [2019-09-20 13:28:08,151 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 263 transitions. Word has length 64 [2019-09-20 13:28:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,151 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 263 transitions. [2019-09-20 13:28:08,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 263 transitions. [2019-09-20 13:28:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:28:08,152 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,152 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,153 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1777808409, now seen corresponding path program 1 times [2019-09-20 13:28:08,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:08,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,219 INFO L87 Difference]: Start difference. First operand 176 states and 263 transitions. Second operand 4 states. [2019-09-20 13:28:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,466 INFO L93 Difference]: Finished difference Result 189 states and 278 transitions. [2019-09-20 13:28:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:28:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,468 INFO L225 Difference]: With dead ends: 189 [2019-09-20 13:28:08,468 INFO L226 Difference]: Without dead ends: 189 [2019-09-20 13:28:08,468 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-20 13:28:08,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-20 13:28:08,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2019-09-20 13:28:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-20 13:28:08,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 262 transitions. [2019-09-20 13:28:08,474 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 262 transitions. Word has length 65 [2019-09-20 13:28:08,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,475 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 262 transitions. [2019-09-20 13:28:08,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 262 transitions. [2019-09-20 13:28:08,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:08,476 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,476 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,476 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,477 INFO L82 PathProgramCache]: Analyzing trace with hash 216625112, now seen corresponding path program 1 times [2019-09-20 13:28:08,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:08,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,554 INFO L87 Difference]: Start difference. First operand 176 states and 262 transitions. Second operand 4 states. [2019-09-20 13:28:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,793 INFO L93 Difference]: Finished difference Result 189 states and 277 transitions. [2019-09-20 13:28:08,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:08,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,796 INFO L225 Difference]: With dead ends: 189 [2019-09-20 13:28:08,796 INFO L226 Difference]: Without dead ends: 189 [2019-09-20 13:28:08,797 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-20 13:28:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-20 13:28:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2019-09-20 13:28:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-20 13:28:08,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 261 transitions. [2019-09-20 13:28:08,802 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 261 transitions. Word has length 66 [2019-09-20 13:28:08,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,802 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 261 transitions. [2019-09-20 13:28:08,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,803 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 261 transitions. [2019-09-20 13:28:08,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:28:08,803 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,804 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,804 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1875725324, now seen corresponding path program 1 times [2019-09-20 13:28:08,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:08,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,861 INFO L87 Difference]: Start difference. First operand 176 states and 261 transitions. Second operand 4 states. [2019-09-20 13:28:09,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,133 INFO L93 Difference]: Finished difference Result 189 states and 276 transitions. [2019-09-20 13:28:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,133 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:28:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,134 INFO L225 Difference]: With dead ends: 189 [2019-09-20 13:28:09,134 INFO L226 Difference]: Without dead ends: 189 [2019-09-20 13:28:09,135 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-20 13:28:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-20 13:28:09,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2019-09-20 13:28:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-20 13:28:09,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 260 transitions. [2019-09-20 13:28:09,140 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 260 transitions. Word has length 67 [2019-09-20 13:28:09,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,141 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 260 transitions. [2019-09-20 13:28:09,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,141 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 260 transitions. [2019-09-20 13:28:09,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:28:09,142 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,142 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,143 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,143 INFO L82 PathProgramCache]: Analyzing trace with hash -590347891, now seen corresponding path program 1 times [2019-09-20 13:28:09,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:09,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,216 INFO L87 Difference]: Start difference. First operand 176 states and 260 transitions. Second operand 4 states. [2019-09-20 13:28:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,519 INFO L93 Difference]: Finished difference Result 218 states and 322 transitions. [2019-09-20 13:28:09,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:28:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,521 INFO L225 Difference]: With dead ends: 218 [2019-09-20 13:28:09,521 INFO L226 Difference]: Without dead ends: 218 [2019-09-20 13:28:09,521 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-20 13:28:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-20 13:28:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2019-09-20 13:28:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-20 13:28:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 297 transitions. [2019-09-20 13:28:09,528 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 297 transitions. Word has length 67 [2019-09-20 13:28:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,528 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 297 transitions. [2019-09-20 13:28:09,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 297 transitions. [2019-09-20 13:28:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-20 13:28:09,529 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,529 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,530 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1729427549, now seen corresponding path program 1 times [2019-09-20 13:28:09,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:09,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,584 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,585 INFO L87 Difference]: Start difference. First operand 198 states and 297 transitions. Second operand 4 states. [2019-09-20 13:28:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,819 INFO L93 Difference]: Finished difference Result 201 states and 300 transitions. [2019-09-20 13:28:09,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-09-20 13:28:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,823 INFO L225 Difference]: With dead ends: 201 [2019-09-20 13:28:09,823 INFO L226 Difference]: Without dead ends: 201 [2019-09-20 13:28:09,824 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-20 13:28:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-20 13:28:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2019-09-20 13:28:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-20 13:28:09,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 296 transitions. [2019-09-20 13:28:09,831 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 296 transitions. Word has length 68 [2019-09-20 13:28:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,831 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 296 transitions. [2019-09-20 13:28:09,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,831 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 296 transitions. [2019-09-20 13:28:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:09,832 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,833 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,833 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1703012644, now seen corresponding path program 1 times [2019-09-20 13:28:09,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:09,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,923 INFO L87 Difference]: Start difference. First operand 198 states and 296 transitions. Second operand 4 states. [2019-09-20 13:28:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,204 INFO L93 Difference]: Finished difference Result 218 states and 320 transitions. [2019-09-20 13:28:10,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,206 INFO L225 Difference]: With dead ends: 218 [2019-09-20 13:28:10,206 INFO L226 Difference]: Without dead ends: 218 [2019-09-20 13:28:10,206 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-20 13:28:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-20 13:28:10,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2019-09-20 13:28:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-20 13:28:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 295 transitions. [2019-09-20 13:28:10,212 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 295 transitions. Word has length 80 [2019-09-20 13:28:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,213 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 295 transitions. [2019-09-20 13:28:10,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 295 transitions. [2019-09-20 13:28:10,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:10,214 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,214 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,215 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1170332084, now seen corresponding path program 1 times [2019-09-20 13:28:10,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:10,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,268 INFO L87 Difference]: Start difference. First operand 198 states and 295 transitions. Second operand 4 states. [2019-09-20 13:28:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,623 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2019-09-20 13:28:10,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:10,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,625 INFO L225 Difference]: With dead ends: 217 [2019-09-20 13:28:10,626 INFO L226 Difference]: Without dead ends: 217 [2019-09-20 13:28:10,626 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-20 13:28:10,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-20 13:28:10,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 198. [2019-09-20 13:28:10,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-20 13:28:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 294 transitions. [2019-09-20 13:28:10,633 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 294 transitions. Word has length 81 [2019-09-20 13:28:10,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,633 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 294 transitions. [2019-09-20 13:28:10,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 294 transitions. [2019-09-20 13:28:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:10,634 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,634 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,635 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,635 INFO L82 PathProgramCache]: Analyzing trace with hash -924027947, now seen corresponding path program 1 times [2019-09-20 13:28:10,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:10,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,702 INFO L87 Difference]: Start difference. First operand 198 states and 294 transitions. Second operand 4 states. [2019-09-20 13:28:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,967 INFO L93 Difference]: Finished difference Result 215 states and 315 transitions. [2019-09-20 13:28:10,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,970 INFO L225 Difference]: With dead ends: 215 [2019-09-20 13:28:10,970 INFO L226 Difference]: Without dead ends: 215 [2019-09-20 13:28:10,970 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-20 13:28:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-20 13:28:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2019-09-20 13:28:10,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-20 13:28:10,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 293 transitions. [2019-09-20 13:28:10,976 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 293 transitions. Word has length 81 [2019-09-20 13:28:10,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,976 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 293 transitions. [2019-09-20 13:28:10,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,976 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 293 transitions. [2019-09-20 13:28:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:28:10,977 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,978 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,978 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,978 INFO L82 PathProgramCache]: Analyzing trace with hash 894943047, now seen corresponding path program 1 times [2019-09-20 13:28:10,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:11,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,043 INFO L87 Difference]: Start difference. First operand 198 states and 293 transitions. Second operand 4 states. [2019-09-20 13:28:11,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,390 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2019-09-20 13:28:11,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:28:11,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,393 INFO L225 Difference]: With dead ends: 215 [2019-09-20 13:28:11,393 INFO L226 Difference]: Without dead ends: 215 [2019-09-20 13:28:11,394 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-20 13:28:11,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2019-09-20 13:28:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-20 13:28:11,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 292 transitions. [2019-09-20 13:28:11,400 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 292 transitions. Word has length 82 [2019-09-20 13:28:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,400 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 292 transitions. [2019-09-20 13:28:11,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 292 transitions. [2019-09-20 13:28:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:28:11,401 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,402 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:11,402 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1467541624, now seen corresponding path program 1 times [2019-09-20 13:28:11,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:11,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,489 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,490 INFO L87 Difference]: Start difference. First operand 198 states and 292 transitions. Second operand 4 states. [2019-09-20 13:28:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,791 INFO L93 Difference]: Finished difference Result 215 states and 313 transitions. [2019-09-20 13:28:11,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:28:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,793 INFO L225 Difference]: With dead ends: 215 [2019-09-20 13:28:11,793 INFO L226 Difference]: Without dead ends: 215 [2019-09-20 13:28:11,794 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-20 13:28:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2019-09-20 13:28:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-20 13:28:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 291 transitions. [2019-09-20 13:28:11,800 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 291 transitions. Word has length 83 [2019-09-20 13:28:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,800 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 291 transitions. [2019-09-20 13:28:11,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 291 transitions. [2019-09-20 13:28:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:28:11,801 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,802 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:11,802 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1999431532, now seen corresponding path program 1 times [2019-09-20 13:28:11,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:11,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,861 INFO L87 Difference]: Start difference. First operand 198 states and 291 transitions. Second operand 4 states. [2019-09-20 13:28:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,127 INFO L93 Difference]: Finished difference Result 215 states and 312 transitions. [2019-09-20 13:28:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:28:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,129 INFO L225 Difference]: With dead ends: 215 [2019-09-20 13:28:12,129 INFO L226 Difference]: Without dead ends: 215 [2019-09-20 13:28:12,130 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-20 13:28:12,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-20 13:28:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 198. [2019-09-20 13:28:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-20 13:28:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 290 transitions. [2019-09-20 13:28:12,135 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 290 transitions. Word has length 84 [2019-09-20 13:28:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,136 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 290 transitions. [2019-09-20 13:28:12,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 290 transitions. [2019-09-20 13:28:12,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-20 13:28:12,137 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,137 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:12,137 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1269352701, now seen corresponding path program 1 times [2019-09-20 13:28:12,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:12,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,207 INFO L87 Difference]: Start difference. First operand 198 states and 290 transitions. Second operand 4 states. [2019-09-20 13:28:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,491 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2019-09-20 13:28:12,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-20 13:28:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,494 INFO L225 Difference]: With dead ends: 205 [2019-09-20 13:28:12,494 INFO L226 Difference]: Without dead ends: 205 [2019-09-20 13:28:12,494 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-09-20 13:28:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 198. [2019-09-20 13:28:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-20 13:28:12,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 289 transitions. [2019-09-20 13:28:12,502 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 289 transitions. Word has length 85 [2019-09-20 13:28:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,503 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 289 transitions. [2019-09-20 13:28:12,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,503 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 289 transitions. [2019-09-20 13:28:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:28:12,505 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,506 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:12,506 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,507 INFO L82 PathProgramCache]: Analyzing trace with hash -543419611, now seen corresponding path program 1 times [2019-09-20 13:28:12,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,618 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:12,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,620 INFO L87 Difference]: Start difference. First operand 198 states and 289 transitions. Second operand 4 states. [2019-09-20 13:28:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,225 INFO L93 Difference]: Finished difference Result 307 states and 456 transitions. [2019-09-20 13:28:13,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:28:13,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,229 INFO L225 Difference]: With dead ends: 307 [2019-09-20 13:28:13,229 INFO L226 Difference]: Without dead ends: 307 [2019-09-20 13:28:13,230 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-20 13:28:13,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-20 13:28:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 239. [2019-09-20 13:28:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-09-20 13:28:13,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 362 transitions. [2019-09-20 13:28:13,242 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 362 transitions. Word has length 89 [2019-09-20 13:28:13,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,243 INFO L475 AbstractCegarLoop]: Abstraction has 239 states and 362 transitions. [2019-09-20 13:28:13,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,243 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 362 transitions. [2019-09-20 13:28:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:28:13,246 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,246 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:13,247 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash -295273117, now seen corresponding path program 1 times [2019-09-20 13:28:13,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:13,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,407 INFO L87 Difference]: Start difference. First operand 239 states and 362 transitions. Second operand 4 states. [2019-09-20 13:28:13,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,847 INFO L93 Difference]: Finished difference Result 287 states and 433 transitions. [2019-09-20 13:28:13,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:28:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,850 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:13,851 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:13,851 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-20 13:28:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-09-20 13:28:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:13,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 403 transitions. [2019-09-20 13:28:13,864 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 403 transitions. Word has length 89 [2019-09-20 13:28:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,865 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 403 transitions. [2019-09-20 13:28:13,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 403 transitions. [2019-09-20 13:28:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-20 13:28:13,867 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,868 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:13,868 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,869 INFO L82 PathProgramCache]: Analyzing trace with hash -16332279, now seen corresponding path program 1 times [2019-09-20 13:28:13,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:14,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,017 INFO L87 Difference]: Start difference. First operand 263 states and 403 transitions. Second operand 4 states. [2019-09-20 13:28:14,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,508 INFO L93 Difference]: Finished difference Result 322 states and 483 transitions. [2019-09-20 13:28:14,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-20 13:28:14,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,511 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:28:14,511 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:28:14,512 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-20 13:28:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:28:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 264. [2019-09-20 13:28:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 404 transitions. [2019-09-20 13:28:14,519 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 404 transitions. Word has length 90 [2019-09-20 13:28:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,520 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 404 transitions. [2019-09-20 13:28:14,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 404 transitions. [2019-09-20 13:28:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:14,521 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,522 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,522 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash 608775820, now seen corresponding path program 1 times [2019-09-20 13:28:14,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:14,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,600 INFO L87 Difference]: Start difference. First operand 264 states and 404 transitions. Second operand 4 states. [2019-09-20 13:28:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,080 INFO L93 Difference]: Finished difference Result 322 states and 482 transitions. [2019-09-20 13:28:15,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,083 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:28:15,084 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:28:15,084 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-20 13:28:15,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:28:15,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 264. [2019-09-20 13:28:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 403 transitions. [2019-09-20 13:28:15,091 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 403 transitions. Word has length 102 [2019-09-20 13:28:15,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,091 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 403 transitions. [2019-09-20 13:28:15,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,091 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 403 transitions. [2019-09-20 13:28:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:15,093 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,093 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:15,093 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1995561230, now seen corresponding path program 1 times [2019-09-20 13:28:15,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:15,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,174 INFO L87 Difference]: Start difference. First operand 264 states and 403 transitions. Second operand 4 states. [2019-09-20 13:28:15,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,594 INFO L93 Difference]: Finished difference Result 288 states and 432 transitions. [2019-09-20 13:28:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:15,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,597 INFO L225 Difference]: With dead ends: 288 [2019-09-20 13:28:15,597 INFO L226 Difference]: Without dead ends: 288 [2019-09-20 13:28:15,597 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-20 13:28:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-20 13:28:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 264. [2019-09-20 13:28:15,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:15,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 402 transitions. [2019-09-20 13:28:15,605 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 402 transitions. Word has length 102 [2019-09-20 13:28:15,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,605 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 402 transitions. [2019-09-20 13:28:15,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 402 transitions. [2019-09-20 13:28:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:15,607 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,608 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:15,608 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1608728908, now seen corresponding path program 1 times [2019-09-20 13:28:15,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:15,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,726 INFO L87 Difference]: Start difference. First operand 264 states and 402 transitions. Second operand 4 states. [2019-09-20 13:28:16,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,167 INFO L93 Difference]: Finished difference Result 321 states and 479 transitions. [2019-09-20 13:28:16,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:16,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,170 INFO L225 Difference]: With dead ends: 321 [2019-09-20 13:28:16,170 INFO L226 Difference]: Without dead ends: 321 [2019-09-20 13:28:16,170 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-20 13:28:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-20 13:28:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 264. [2019-09-20 13:28:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 401 transitions. [2019-09-20 13:28:16,177 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 401 transitions. Word has length 103 [2019-09-20 13:28:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,177 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 401 transitions. [2019-09-20 13:28:16,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,178 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 401 transitions. [2019-09-20 13:28:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:16,179 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,180 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,180 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash -485631123, now seen corresponding path program 1 times [2019-09-20 13:28:16,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:16,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,273 INFO L87 Difference]: Start difference. First operand 264 states and 401 transitions. Second operand 4 states. [2019-09-20 13:28:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,695 INFO L93 Difference]: Finished difference Result 319 states and 476 transitions. [2019-09-20 13:28:16,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,698 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:16,699 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:16,699 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-20 13:28:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 264. [2019-09-20 13:28:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 400 transitions. [2019-09-20 13:28:16,706 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 400 transitions. Word has length 103 [2019-09-20 13:28:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,707 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 400 transitions. [2019-09-20 13:28:16,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 400 transitions. [2019-09-20 13:28:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:16,708 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,709 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,709 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1649403658, now seen corresponding path program 1 times [2019-09-20 13:28:16,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:16,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,784 INFO L87 Difference]: Start difference. First operand 264 states and 400 transitions. Second operand 4 states. [2019-09-20 13:28:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,099 INFO L93 Difference]: Finished difference Result 287 states and 428 transitions. [2019-09-20 13:28:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,101 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:17,101 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:17,102 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-20 13:28:17,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 264. [2019-09-20 13:28:17,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 399 transitions. [2019-09-20 13:28:17,108 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 399 transitions. Word has length 103 [2019-09-20 13:28:17,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,109 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 399 transitions. [2019-09-20 13:28:17,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,109 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 399 transitions. [2019-09-20 13:28:17,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:17,110 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,111 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,111 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,111 INFO L82 PathProgramCache]: Analyzing trace with hash -444956373, now seen corresponding path program 1 times [2019-09-20 13:28:17,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,188 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:17,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,190 INFO L87 Difference]: Start difference. First operand 264 states and 399 transitions. Second operand 4 states. [2019-09-20 13:28:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,513 INFO L93 Difference]: Finished difference Result 285 states and 425 transitions. [2019-09-20 13:28:17,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,516 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:28:17,516 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:28:17,516 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-20 13:28:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:28:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2019-09-20 13:28:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2019-09-20 13:28:17,524 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 103 [2019-09-20 13:28:17,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,545 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2019-09-20 13:28:17,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2019-09-20 13:28:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:17,547 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,547 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,547 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1600342703, now seen corresponding path program 1 times [2019-09-20 13:28:17,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:17,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,607 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 4 states. [2019-09-20 13:28:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,015 INFO L93 Difference]: Finished difference Result 319 states and 473 transitions. [2019-09-20 13:28:18,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:18,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,018 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:18,018 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:18,019 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-20 13:28:18,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:18,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 264. [2019-09-20 13:28:18,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 397 transitions. [2019-09-20 13:28:18,025 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 397 transitions. Word has length 104 [2019-09-20 13:28:18,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,026 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 397 transitions. [2019-09-20 13:28:18,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,026 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 397 transitions. [2019-09-20 13:28:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:18,027 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,028 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:18,028 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1433707343, now seen corresponding path program 1 times [2019-09-20 13:28:18,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:18,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,085 INFO L87 Difference]: Start difference. First operand 264 states and 397 transitions. Second operand 4 states. [2019-09-20 13:28:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,413 INFO L93 Difference]: Finished difference Result 285 states and 423 transitions. [2019-09-20 13:28:18,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,416 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:28:18,416 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:28:18,417 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-20 13:28:18,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:28:18,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2019-09-20 13:28:18,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 396 transitions. [2019-09-20 13:28:18,423 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 396 transitions. Word has length 104 [2019-09-20 13:28:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,423 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 396 transitions. [2019-09-20 13:28:18,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 396 transitions. [2019-09-20 13:28:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:18,425 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,425 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:18,425 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1860094480, now seen corresponding path program 1 times [2019-09-20 13:28:18,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:18,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,485 INFO L87 Difference]: Start difference. First operand 264 states and 396 transitions. Second operand 4 states. [2019-09-20 13:28:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,880 INFO L93 Difference]: Finished difference Result 319 states and 471 transitions. [2019-09-20 13:28:18,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,883 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:18,883 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:18,883 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-20 13:28:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 264. [2019-09-20 13:28:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 395 transitions. [2019-09-20 13:28:18,893 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 395 transitions. Word has length 105 [2019-09-20 13:28:18,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,893 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 395 transitions. [2019-09-20 13:28:18,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,893 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 395 transitions. [2019-09-20 13:28:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:18,896 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,896 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:18,897 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2001143730, now seen corresponding path program 1 times [2019-09-20 13:28:18,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:18,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,972 INFO L87 Difference]: Start difference. First operand 264 states and 395 transitions. Second operand 4 states. [2019-09-20 13:28:19,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,265 INFO L93 Difference]: Finished difference Result 285 states and 421 transitions. [2019-09-20 13:28:19,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,268 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:28:19,268 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:28:19,269 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-20 13:28:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:28:19,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2019-09-20 13:28:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 394 transitions. [2019-09-20 13:28:19,274 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 394 transitions. Word has length 105 [2019-09-20 13:28:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,275 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 394 transitions. [2019-09-20 13:28:19,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 394 transitions. [2019-09-20 13:28:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:19,276 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,276 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,277 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1283668180, now seen corresponding path program 1 times [2019-09-20 13:28:19,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:19,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,344 INFO L87 Difference]: Start difference. First operand 264 states and 394 transitions. Second operand 4 states. [2019-09-20 13:28:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,757 INFO L93 Difference]: Finished difference Result 319 states and 469 transitions. [2019-09-20 13:28:19,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,760 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:19,760 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:19,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-20 13:28:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 264. [2019-09-20 13:28:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 393 transitions. [2019-09-20 13:28:19,767 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 393 transitions. Word has length 106 [2019-09-20 13:28:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,767 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 393 transitions. [2019-09-20 13:28:19,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 393 transitions. [2019-09-20 13:28:19,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:19,769 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,769 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,770 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1844367958, now seen corresponding path program 1 times [2019-09-20 13:28:19,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:19,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,840 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,841 INFO L87 Difference]: Start difference. First operand 264 states and 393 transitions. Second operand 4 states. [2019-09-20 13:28:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,179 INFO L93 Difference]: Finished difference Result 285 states and 419 transitions. [2019-09-20 13:28:20,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,182 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:28:20,182 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:28:20,183 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-20 13:28:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:28:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 264. [2019-09-20 13:28:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:20,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 392 transitions. [2019-09-20 13:28:20,190 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 392 transitions. Word has length 106 [2019-09-20 13:28:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,191 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 392 transitions. [2019-09-20 13:28:20,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 392 transitions. [2019-09-20 13:28:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:28:20,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,194 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:20,194 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,195 INFO L82 PathProgramCache]: Analyzing trace with hash 555525269, now seen corresponding path program 1 times [2019-09-20 13:28:20,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:20,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,266 INFO L87 Difference]: Start difference. First operand 264 states and 392 transitions. Second operand 4 states. [2019-09-20 13:28:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,660 INFO L93 Difference]: Finished difference Result 309 states and 455 transitions. [2019-09-20 13:28:20,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:28:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,663 INFO L225 Difference]: With dead ends: 309 [2019-09-20 13:28:20,663 INFO L226 Difference]: Without dead ends: 309 [2019-09-20 13:28:20,664 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-20 13:28:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-20 13:28:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 264. [2019-09-20 13:28:20,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 391 transitions. [2019-09-20 13:28:20,671 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 391 transitions. Word has length 107 [2019-09-20 13:28:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,672 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 391 transitions. [2019-09-20 13:28:20,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 391 transitions. [2019-09-20 13:28:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-20 13:28:20,674 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,674 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:20,674 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,675 INFO L82 PathProgramCache]: Analyzing trace with hash 757349203, now seen corresponding path program 1 times [2019-09-20 13:28:20,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:20,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,753 INFO L87 Difference]: Start difference. First operand 264 states and 391 transitions. Second operand 4 states. [2019-09-20 13:28:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,045 INFO L93 Difference]: Finished difference Result 275 states and 405 transitions. [2019-09-20 13:28:21,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-09-20 13:28:21,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,047 INFO L225 Difference]: With dead ends: 275 [2019-09-20 13:28:21,048 INFO L226 Difference]: Without dead ends: 275 [2019-09-20 13:28:21,048 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-20 13:28:21,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-20 13:28:21,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2019-09-20 13:28:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 390 transitions. [2019-09-20 13:28:21,054 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 390 transitions. Word has length 107 [2019-09-20 13:28:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,054 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 390 transitions. [2019-09-20 13:28:21,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 390 transitions. [2019-09-20 13:28:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:28:21,055 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,055 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:21,056 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,056 INFO L82 PathProgramCache]: Analyzing trace with hash -851940951, now seen corresponding path program 1 times [2019-09-20 13:28:21,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,128 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:21,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,130 INFO L87 Difference]: Start difference. First operand 264 states and 390 transitions. Second operand 4 states. [2019-09-20 13:28:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,517 INFO L93 Difference]: Finished difference Result 309 states and 453 transitions. [2019-09-20 13:28:21,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-09-20 13:28:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,520 INFO L225 Difference]: With dead ends: 309 [2019-09-20 13:28:21,520 INFO L226 Difference]: Without dead ends: 309 [2019-09-20 13:28:21,521 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-20 13:28:21,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-20 13:28:21,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 264. [2019-09-20 13:28:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 389 transitions. [2019-09-20 13:28:21,527 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 389 transitions. Word has length 111 [2019-09-20 13:28:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,528 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 389 transitions. [2019-09-20 13:28:21,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,528 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 389 transitions. [2019-09-20 13:28:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-20 13:28:21,529 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,529 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:21,529 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,530 INFO L82 PathProgramCache]: Analyzing trace with hash -906333849, now seen corresponding path program 1 times [2019-09-20 13:28:21,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,626 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:28:21,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:21,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:21,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:21,629 INFO L87 Difference]: Start difference. First operand 264 states and 389 transitions. Second operand 3 states. [2019-09-20 13:28:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,719 INFO L93 Difference]: Finished difference Result 501 states and 738 transitions. [2019-09-20 13:28:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:21,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-20 13:28:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,722 INFO L225 Difference]: With dead ends: 501 [2019-09-20 13:28:21,722 INFO L226 Difference]: Without dead ends: 501 [2019-09-20 13:28:21,722 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-20 13:28:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-09-20 13:28:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2019-09-20 13:28:21,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-20 13:28:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 738 transitions. [2019-09-20 13:28:21,731 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 738 transitions. Word has length 111 [2019-09-20 13:28:21,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,731 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 738 transitions. [2019-09-20 13:28:21,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 738 transitions. [2019-09-20 13:28:21,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-20 13:28:21,733 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,733 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:21,733 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1936084989, now seen corresponding path program 1 times [2019-09-20 13:28:21,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:21,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,818 INFO L87 Difference]: Start difference. First operand 501 states and 738 transitions. Second operand 4 states. [2019-09-20 13:28:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,281 INFO L93 Difference]: Finished difference Result 713 states and 1059 transitions. [2019-09-20 13:28:22,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-20 13:28:22,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,286 INFO L225 Difference]: With dead ends: 713 [2019-09-20 13:28:22,286 INFO L226 Difference]: Without dead ends: 713 [2019-09-20 13:28:22,287 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-20 13:28:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-09-20 13:28:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 579. [2019-09-20 13:28:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-09-20 13:28:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 880 transitions. [2019-09-20 13:28:22,298 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 880 transitions. Word has length 130 [2019-09-20 13:28:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,298 INFO L475 AbstractCegarLoop]: Abstraction has 579 states and 880 transitions. [2019-09-20 13:28:22,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 880 transitions. [2019-09-20 13:28:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-20 13:28:22,300 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,300 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:22,301 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,301 INFO L82 PathProgramCache]: Analyzing trace with hash -239286037, now seen corresponding path program 1 times [2019-09-20 13:28:22,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:22,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,390 INFO L87 Difference]: Start difference. First operand 579 states and 880 transitions. Second operand 4 states. [2019-09-20 13:28:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,840 INFO L93 Difference]: Finished difference Result 697 states and 1036 transitions. [2019-09-20 13:28:22,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-20 13:28:22,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,844 INFO L225 Difference]: With dead ends: 697 [2019-09-20 13:28:22,844 INFO L226 Difference]: Without dead ends: 697 [2019-09-20 13:28:22,845 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-20 13:28:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-20 13:28:22,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 549. [2019-09-20 13:28:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 822 transitions. [2019-09-20 13:28:22,855 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 822 transitions. Word has length 131 [2019-09-20 13:28:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,856 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 822 transitions. [2019-09-20 13:28:22,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 822 transitions. [2019-09-20 13:28:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-20 13:28:22,858 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,858 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-20 13:28:22,858 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1067313774, now seen corresponding path program 1 times [2019-09-20 13:28:22,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:22,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,929 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,930 INFO L87 Difference]: Start difference. First operand 549 states and 822 transitions. Second operand 4 states. [2019-09-20 13:28:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,389 INFO L93 Difference]: Finished difference Result 697 states and 1034 transitions. [2019-09-20 13:28:23,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-20 13:28:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,394 INFO L225 Difference]: With dead ends: 697 [2019-09-20 13:28:23,394 INFO L226 Difference]: Without dead ends: 697 [2019-09-20 13:28:23,395 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-20 13:28:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-20 13:28:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 549. [2019-09-20 13:28:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 820 transitions. [2019-09-20 13:28:23,406 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 820 transitions. Word has length 143 [2019-09-20 13:28:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,406 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 820 transitions. [2019-09-20 13:28:23,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,406 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 820 transitions. [2019-09-20 13:28:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-20 13:28:23,408 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,408 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:23,408 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1356463702, now seen corresponding path program 1 times [2019-09-20 13:28:23,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:23,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,500 INFO L87 Difference]: Start difference. First operand 549 states and 820 transitions. Second operand 4 states. [2019-09-20 13:28:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,989 INFO L93 Difference]: Finished difference Result 695 states and 1030 transitions. [2019-09-20 13:28:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-20 13:28:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,993 INFO L225 Difference]: With dead ends: 695 [2019-09-20 13:28:23,993 INFO L226 Difference]: Without dead ends: 695 [2019-09-20 13:28:23,994 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-20 13:28:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-09-20 13:28:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 549. [2019-09-20 13:28:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 818 transitions. [2019-09-20 13:28:24,003 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 818 transitions. Word has length 144 [2019-09-20 13:28:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,004 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 818 transitions. [2019-09-20 13:28:24,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 818 transitions. [2019-09-20 13:28:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-20 13:28:24,005 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,006 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:24,006 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash 844143563, now seen corresponding path program 1 times [2019-09-20 13:28:24,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:24,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,078 INFO L87 Difference]: Start difference. First operand 549 states and 818 transitions. Second operand 4 states. [2019-09-20 13:28:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,499 INFO L93 Difference]: Finished difference Result 691 states and 1024 transitions. [2019-09-20 13:28:24,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-20 13:28:24,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,505 INFO L225 Difference]: With dead ends: 691 [2019-09-20 13:28:24,505 INFO L226 Difference]: Without dead ends: 691 [2019-09-20 13:28:24,505 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-20 13:28:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-09-20 13:28:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 549. [2019-09-20 13:28:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 816 transitions. [2019-09-20 13:28:24,515 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 816 transitions. Word has length 144 [2019-09-20 13:28:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,515 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 816 transitions. [2019-09-20 13:28:24,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 816 transitions. [2019-09-20 13:28:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:28:24,517 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,517 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:24,518 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,518 INFO L82 PathProgramCache]: Analyzing trace with hash -126314991, now seen corresponding path program 1 times [2019-09-20 13:28:24,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:24,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,601 INFO L87 Difference]: Start difference. First operand 549 states and 816 transitions. Second operand 4 states. [2019-09-20 13:28:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,080 INFO L93 Difference]: Finished difference Result 691 states and 1022 transitions. [2019-09-20 13:28:25,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-20 13:28:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,085 INFO L225 Difference]: With dead ends: 691 [2019-09-20 13:28:25,085 INFO L226 Difference]: Without dead ends: 691 [2019-09-20 13:28:25,085 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-20 13:28:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-09-20 13:28:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 549. [2019-09-20 13:28:25,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 814 transitions. [2019-09-20 13:28:25,094 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 814 transitions. Word has length 145 [2019-09-20 13:28:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,095 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 814 transitions. [2019-09-20 13:28:25,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 814 transitions. [2019-09-20 13:28:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-20 13:28:25,097 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,097 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,098 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,098 INFO L82 PathProgramCache]: Analyzing trace with hash -126686482, now seen corresponding path program 1 times [2019-09-20 13:28:25,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:25,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,173 INFO L87 Difference]: Start difference. First operand 549 states and 814 transitions. Second operand 4 states. [2019-09-20 13:28:25,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,625 INFO L93 Difference]: Finished difference Result 691 states and 1020 transitions. [2019-09-20 13:28:25,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-20 13:28:25,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,630 INFO L225 Difference]: With dead ends: 691 [2019-09-20 13:28:25,630 INFO L226 Difference]: Without dead ends: 691 [2019-09-20 13:28:25,631 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-20 13:28:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-09-20 13:28:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 549. [2019-09-20 13:28:25,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 812 transitions. [2019-09-20 13:28:25,640 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 812 transitions. Word has length 146 [2019-09-20 13:28:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,641 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 812 transitions. [2019-09-20 13:28:25,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 812 transitions. [2019-09-20 13:28:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-20 13:28:25,644 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,644 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:25,645 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,645 INFO L82 PathProgramCache]: Analyzing trace with hash -176999498, now seen corresponding path program 1 times [2019-09-20 13:28:25,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:25,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,733 INFO L87 Difference]: Start difference. First operand 549 states and 812 transitions. Second operand 4 states. [2019-09-20 13:28:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,196 INFO L93 Difference]: Finished difference Result 691 states and 1018 transitions. [2019-09-20 13:28:26,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-20 13:28:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,200 INFO L225 Difference]: With dead ends: 691 [2019-09-20 13:28:26,200 INFO L226 Difference]: Without dead ends: 691 [2019-09-20 13:28:26,200 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-20 13:28:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2019-09-20 13:28:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 549. [2019-09-20 13:28:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 810 transitions. [2019-09-20 13:28:26,211 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 810 transitions. Word has length 147 [2019-09-20 13:28:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,211 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 810 transitions. [2019-09-20 13:28:26,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 810 transitions. [2019-09-20 13:28:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-20 13:28:26,213 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,214 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,215 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1775499789, now seen corresponding path program 1 times [2019-09-20 13:28:26,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:26,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,327 INFO L87 Difference]: Start difference. First operand 549 states and 810 transitions. Second operand 4 states. [2019-09-20 13:28:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,713 INFO L93 Difference]: Finished difference Result 671 states and 992 transitions. [2019-09-20 13:28:26,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-09-20 13:28:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,717 INFO L225 Difference]: With dead ends: 671 [2019-09-20 13:28:26,717 INFO L226 Difference]: Without dead ends: 671 [2019-09-20 13:28:26,717 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-20 13:28:26,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-20 13:28:26,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 549. [2019-09-20 13:28:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-09-20 13:28:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 808 transitions. [2019-09-20 13:28:26,726 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 808 transitions. Word has length 148 [2019-09-20 13:28:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,727 INFO L475 AbstractCegarLoop]: Abstraction has 549 states and 808 transitions. [2019-09-20 13:28:26,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 808 transitions. [2019-09-20 13:28:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-20 13:28:26,728 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,729 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:26,729 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2128342023, now seen corresponding path program 1 times [2019-09-20 13:28:26,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:26,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,816 INFO L87 Difference]: Start difference. First operand 549 states and 808 transitions. Second operand 4 states. [2019-09-20 13:28:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,225 INFO L93 Difference]: Finished difference Result 671 states and 990 transitions. [2019-09-20 13:28:27,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-20 13:28:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,230 INFO L225 Difference]: With dead ends: 671 [2019-09-20 13:28:27,231 INFO L226 Difference]: Without dead ends: 671 [2019-09-20 13:28:27,231 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-20 13:28:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-20 13:28:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 501. [2019-09-20 13:28:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-09-20 13:28:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 738 transitions. [2019-09-20 13:28:27,240 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 738 transitions. Word has length 152 [2019-09-20 13:28:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,240 INFO L475 AbstractCegarLoop]: Abstraction has 501 states and 738 transitions. [2019-09-20 13:28:27,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 738 transitions. [2019-09-20 13:28:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-20 13:28:27,242 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,242 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:27,242 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,243 INFO L82 PathProgramCache]: Analyzing trace with hash -512372534, now seen corresponding path program 1 times [2019-09-20 13:28:27,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:27,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,314 INFO L87 Difference]: Start difference. First operand 501 states and 738 transitions. Second operand 4 states. [2019-09-20 13:28:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,711 INFO L93 Difference]: Finished difference Result 663 states and 978 transitions. [2019-09-20 13:28:27,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-20 13:28:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,716 INFO L225 Difference]: With dead ends: 663 [2019-09-20 13:28:27,717 INFO L226 Difference]: Without dead ends: 663 [2019-09-20 13:28:27,717 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-20 13:28:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-20 13:28:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 551. [2019-09-20 13:28:27,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-20 13:28:27,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 808 transitions. [2019-09-20 13:28:27,726 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 808 transitions. Word has length 153 [2019-09-20 13:28:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,726 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 808 transitions. [2019-09-20 13:28:27,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 808 transitions. [2019-09-20 13:28:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:28:27,728 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,728 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:27,729 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1670463979, now seen corresponding path program 1 times [2019-09-20 13:28:27,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:27,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,811 INFO L87 Difference]: Start difference. First operand 551 states and 808 transitions. Second operand 4 states. [2019-09-20 13:28:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,217 INFO L93 Difference]: Finished difference Result 663 states and 976 transitions. [2019-09-20 13:28:28,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:28:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,222 INFO L225 Difference]: With dead ends: 663 [2019-09-20 13:28:28,222 INFO L226 Difference]: Without dead ends: 663 [2019-09-20 13:28:28,223 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-20 13:28:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-20 13:28:28,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 557. [2019-09-20 13:28:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-20 13:28:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 818 transitions. [2019-09-20 13:28:28,231 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 818 transitions. Word has length 155 [2019-09-20 13:28:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,231 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 818 transitions. [2019-09-20 13:28:28,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 818 transitions. [2019-09-20 13:28:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:28:28,233 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,233 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:28,233 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1548465272, now seen corresponding path program 1 times [2019-09-20 13:28:28,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:28,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,345 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,348 INFO L87 Difference]: Start difference. First operand 557 states and 818 transitions. Second operand 4 states. [2019-09-20 13:28:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,818 INFO L93 Difference]: Finished difference Result 647 states and 948 transitions. [2019-09-20 13:28:28,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:28:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,823 INFO L225 Difference]: With dead ends: 647 [2019-09-20 13:28:28,823 INFO L226 Difference]: Without dead ends: 647 [2019-09-20 13:28:28,825 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-20 13:28:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-20 13:28:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 559. [2019-09-20 13:28:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-20 13:28:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 820 transitions. [2019-09-20 13:28:28,835 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 820 transitions. Word has length 156 [2019-09-20 13:28:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,835 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 820 transitions. [2019-09-20 13:28:28,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 820 transitions. [2019-09-20 13:28:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:28:28,837 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,837 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:28,837 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1738936081, now seen corresponding path program 1 times [2019-09-20 13:28:28,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:28,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,931 INFO L87 Difference]: Start difference. First operand 559 states and 820 transitions. Second operand 4 states. [2019-09-20 13:28:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,301 INFO L93 Difference]: Finished difference Result 647 states and 946 transitions. [2019-09-20 13:28:29,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:28:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,307 INFO L225 Difference]: With dead ends: 647 [2019-09-20 13:28:29,307 INFO L226 Difference]: Without dead ends: 647 [2019-09-20 13:28:29,308 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-20 13:28:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-20 13:28:29,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 561. [2019-09-20 13:28:29,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-20 13:28:29,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 822 transitions. [2019-09-20 13:28:29,317 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 822 transitions. Word has length 157 [2019-09-20 13:28:29,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,318 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 822 transitions. [2019-09-20 13:28:29,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 822 transitions. [2019-09-20 13:28:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:28:29,322 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,323 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:29,323 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 381061618, now seen corresponding path program 1 times [2019-09-20 13:28:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,406 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:29,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,406 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,407 INFO L87 Difference]: Start difference. First operand 561 states and 822 transitions. Second operand 4 states. [2019-09-20 13:28:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,737 INFO L93 Difference]: Finished difference Result 647 states and 944 transitions. [2019-09-20 13:28:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:28:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,741 INFO L225 Difference]: With dead ends: 647 [2019-09-20 13:28:29,742 INFO L226 Difference]: Without dead ends: 647 [2019-09-20 13:28:29,742 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-20 13:28:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-20 13:28:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 561. [2019-09-20 13:28:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-20 13:28:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 820 transitions. [2019-09-20 13:28:29,750 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 820 transitions. Word has length 158 [2019-09-20 13:28:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,750 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 820 transitions. [2019-09-20 13:28:29,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 820 transitions. [2019-09-20 13:28:29,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:28:29,752 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,752 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:29,752 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1947360782, now seen corresponding path program 1 times [2019-09-20 13:28:29,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:29,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,838 INFO L87 Difference]: Start difference. First operand 561 states and 820 transitions. Second operand 4 states. [2019-09-20 13:28:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,180 INFO L93 Difference]: Finished difference Result 643 states and 938 transitions. [2019-09-20 13:28:30,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:30,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:28:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,184 INFO L225 Difference]: With dead ends: 643 [2019-09-20 13:28:30,184 INFO L226 Difference]: Without dead ends: 643 [2019-09-20 13:28:30,184 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-20 13:28:30,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-09-20 13:28:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 563. [2019-09-20 13:28:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-20 13:28:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 822 transitions. [2019-09-20 13:28:30,192 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 822 transitions. Word has length 158 [2019-09-20 13:28:30,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,192 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 822 transitions. [2019-09-20 13:28:30,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 822 transitions. [2019-09-20 13:28:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:28:30,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,194 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:30,194 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,195 INFO L82 PathProgramCache]: Analyzing trace with hash -648430635, now seen corresponding path program 1 times [2019-09-20 13:28:30,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:30,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,277 INFO L87 Difference]: Start difference. First operand 563 states and 822 transitions. Second operand 4 states. [2019-09-20 13:28:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,618 INFO L93 Difference]: Finished difference Result 639 states and 930 transitions. [2019-09-20 13:28:30,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:30,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:28:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,621 INFO L225 Difference]: With dead ends: 639 [2019-09-20 13:28:30,621 INFO L226 Difference]: Without dead ends: 639 [2019-09-20 13:28:30,622 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-20 13:28:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-20 13:28:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 563. [2019-09-20 13:28:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-20 13:28:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 820 transitions. [2019-09-20 13:28:30,630 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 820 transitions. Word has length 159 [2019-09-20 13:28:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,630 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 820 transitions. [2019-09-20 13:28:30,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 820 transitions. [2019-09-20 13:28:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:28:30,632 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,632 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:30,632 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,633 INFO L82 PathProgramCache]: Analyzing trace with hash 166500723, now seen corresponding path program 1 times [2019-09-20 13:28:30,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,754 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:30,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,755 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,756 INFO L87 Difference]: Start difference. First operand 563 states and 820 transitions. Second operand 4 states. [2019-09-20 13:28:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,085 INFO L93 Difference]: Finished difference Result 633 states and 920 transitions. [2019-09-20 13:28:31,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:31,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-20 13:28:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,089 INFO L225 Difference]: With dead ends: 633 [2019-09-20 13:28:31,089 INFO L226 Difference]: Without dead ends: 633 [2019-09-20 13:28:31,089 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-20 13:28:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-20 13:28:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 565. [2019-09-20 13:28:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-20 13:28:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 822 transitions. [2019-09-20 13:28:31,095 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 822 transitions. Word has length 159 [2019-09-20 13:28:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,096 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 822 transitions. [2019-09-20 13:28:31,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 822 transitions. [2019-09-20 13:28:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-20 13:28:31,097 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,098 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:31,098 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash 594628049, now seen corresponding path program 1 times [2019-09-20 13:28:31,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:31,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:31,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:31,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:31,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:31,181 INFO L87 Difference]: Start difference. First operand 565 states and 822 transitions. Second operand 4 states. [2019-09-20 13:28:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,488 INFO L93 Difference]: Finished difference Result 633 states and 918 transitions. [2019-09-20 13:28:31,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:31,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-20 13:28:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,493 INFO L225 Difference]: With dead ends: 633 [2019-09-20 13:28:31,493 INFO L226 Difference]: Without dead ends: 633 [2019-09-20 13:28:31,493 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-20 13:28:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-20 13:28:31,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 567. [2019-09-20 13:28:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-20 13:28:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 824 transitions. [2019-09-20 13:28:31,499 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 824 transitions. Word has length 161 [2019-09-20 13:28:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,500 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 824 transitions. [2019-09-20 13:28:31,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 824 transitions. [2019-09-20 13:28:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-20 13:28:31,501 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,501 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:31,501 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,502 INFO L82 PathProgramCache]: Analyzing trace with hash -435456567, now seen corresponding path program 1 times [2019-09-20 13:28:31,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:31,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:31,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:31,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:31,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:31,587 INFO L87 Difference]: Start difference. First operand 567 states and 824 transitions. Second operand 4 states. [2019-09-20 13:28:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,975 INFO L93 Difference]: Finished difference Result 625 states and 906 transitions. [2019-09-20 13:28:31,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:31,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-20 13:28:31,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,980 INFO L225 Difference]: With dead ends: 625 [2019-09-20 13:28:31,980 INFO L226 Difference]: Without dead ends: 625 [2019-09-20 13:28:31,981 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-20 13:28:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-20 13:28:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 569. [2019-09-20 13:28:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-20 13:28:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 826 transitions. [2019-09-20 13:28:31,993 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 826 transitions. Word has length 162 [2019-09-20 13:28:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,993 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 826 transitions. [2019-09-20 13:28:31,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 826 transitions. [2019-09-20 13:28:31,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-20 13:28:31,996 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,997 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:31,997 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1901894568, now seen corresponding path program 1 times [2019-09-20 13:28:31,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:32,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:32,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:32,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:32,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:32,119 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:32,119 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:32,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:32,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:32,120 INFO L87 Difference]: Start difference. First operand 569 states and 826 transitions. Second operand 4 states. [2019-09-20 13:28:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:32,449 INFO L93 Difference]: Finished difference Result 625 states and 904 transitions. [2019-09-20 13:28:32,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:32,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-20 13:28:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:32,453 INFO L225 Difference]: With dead ends: 625 [2019-09-20 13:28:32,454 INFO L226 Difference]: Without dead ends: 625 [2019-09-20 13:28:32,454 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-20 13:28:32,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-20 13:28:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 571. [2019-09-20 13:28:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-20 13:28:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 828 transitions. [2019-09-20 13:28:32,461 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 828 transitions. Word has length 162 [2019-09-20 13:28:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:32,461 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 828 transitions. [2019-09-20 13:28:32,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2019-09-20 13:28:32,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-20 13:28:32,462 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:32,463 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:28:32,463 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:32,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1748202496, now seen corresponding path program 1 times [2019-09-20 13:28:32,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:32,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:32,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:32,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:32,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:32,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:32,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:32,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:32,550 INFO L87 Difference]: Start difference. First operand 571 states and 828 transitions. Second operand 4 states.