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.14.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:59,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:59,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:59,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:59,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:59,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:59,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:59,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:59,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:59,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:59,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:59,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:59,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:59,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:59,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:59,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:59,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:59,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:59,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:59,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:59,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:59,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:59,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:59,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:59,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:59,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:59,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:59,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:59,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:59,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:59,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:59,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:59,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:59,766 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:59,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:59,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:59,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:59,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:59,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:59,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:59,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:59,771 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:27:59,785 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:59,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:59,786 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:59,786 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:59,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:59,787 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:59,787 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:59,787 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:59,788 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:59,788 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:59,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:59,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:59,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:59,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:59,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:59,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:59,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:59,790 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:59,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:59,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:59,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:59,791 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:59,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:59,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:59,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:59,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:59,792 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:59,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:59,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:59,792 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:59,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:59,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:59,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:59,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:59,844 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:59,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.14.i.cil-2.c [2019-09-20 13:27:59,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b1926dc/3b7708b8f65f40ff89827f9efccd23e8/FLAG6dc26cada [2019-09-20 13:28:00,538 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:28:00,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.14.i.cil-2.c [2019-09-20 13:28:00,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b1926dc/3b7708b8f65f40ff89827f9efccd23e8/FLAG6dc26cada [2019-09-20 13:28:00,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43b1926dc/3b7708b8f65f40ff89827f9efccd23e8 [2019-09-20 13:28:00,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:28:00,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:28:00,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:00,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:28:00,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:28:00,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:00" (1/1) ... [2019-09-20 13:28:00,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d46b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:00, skipping insertion in model container [2019-09-20 13:28:00,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:28:00" (1/1) ... [2019-09-20 13:28:00,791 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:28:00,875 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:28:01,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:01,479 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:28:01,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:01,689 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:28:01,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01 WrapperNode [2019-09-20 13:28:01,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:01,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:28:01,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:28:01,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:28:01,710 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:01" (1/1) ... [2019-09-20 13:28:01,711 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:01" (1/1) ... [2019-09-20 13:28:01,739 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:01" (1/1) ... [2019-09-20 13:28:01,740 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:01" (1/1) ... [2019-09-20 13:28:01,805 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:01" (1/1) ... [2019-09-20 13:28:01,824 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:01" (1/1) ... [2019-09-20 13:28:01,835 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:01" (1/1) ... [2019-09-20 13:28:01,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:28:01,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:28:01,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:28:01,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:28:01,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (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:01,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:28:01,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:28:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:28:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:28:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:28:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:28:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:28:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:28:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:28:01,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:28:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:28:01,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:28:01,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:28:01,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:28:01,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:28:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:28:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:28:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:28:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:28:01,948 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:28:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:28:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:28:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:28:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:28:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:28:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:28:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:28:01,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:28:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:28:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:28:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:28:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:28:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:28:01,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:28:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:28:02,454 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:28:03,293 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:28:03,293 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:28:03,323 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:28:03,324 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:28:03,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:03 BoogieIcfgContainer [2019-09-20 13:28:03,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:28:03,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:28:03,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:28:03,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:28:03,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:28:00" (1/3) ... [2019-09-20 13:28:03,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4583d8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:03, skipping insertion in model container [2019-09-20 13:28:03,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:28:01" (2/3) ... [2019-09-20 13:28:03,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4583d8c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:28:03, skipping insertion in model container [2019-09-20 13:28:03,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:28:03" (3/3) ... [2019-09-20 13:28:03,337 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2019-09-20 13:28:03,347 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:28:03,358 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:28:03,378 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:28:03,414 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:28:03,414 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:28:03,415 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:28:03,415 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:28:03,415 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:28:03,415 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:28:03,415 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:28:03,416 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:28:03,445 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-09-20 13:28:03,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-20 13:28:03,465 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,466 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] [2019-09-20 13:28:03,468 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1106429626, now seen corresponding path program 1 times [2019-09-20 13:28:03,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,977 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:03,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,012 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 4 states. [2019-09-20 13:28:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,547 INFO L93 Difference]: Finished difference Result 195 states and 320 transitions. [2019-09-20 13:28:04,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-09-20 13:28:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,575 INFO L225 Difference]: With dead ends: 195 [2019-09-20 13:28:04,576 INFO L226 Difference]: Without dead ends: 174 [2019-09-20 13:28:04,580 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:04,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-20 13:28:04,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2019-09-20 13:28:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-20 13:28:04,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 242 transitions. [2019-09-20 13:28:04,636 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 242 transitions. Word has length 48 [2019-09-20 13:28:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,636 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 242 transitions. [2019-09-20 13:28:04,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,637 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 242 transitions. [2019-09-20 13:28:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:28:04,640 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,640 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] [2019-09-20 13:28:04,641 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2020467317, now seen corresponding path program 1 times [2019-09-20 13:28:04,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,797 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:04,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,804 INFO L87 Difference]: Start difference. First operand 157 states and 242 transitions. Second operand 4 states. [2019-09-20 13:28:05,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,243 INFO L93 Difference]: Finished difference Result 174 states and 262 transitions. [2019-09-20 13:28:05,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-09-20 13:28:05,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,247 INFO L225 Difference]: With dead ends: 174 [2019-09-20 13:28:05,247 INFO L226 Difference]: Without dead ends: 174 [2019-09-20 13:28:05,250 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,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-20 13:28:05,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 157. [2019-09-20 13:28:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-20 13:28:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 241 transitions. [2019-09-20 13:28:05,276 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 241 transitions. Word has length 61 [2019-09-20 13:28:05,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,276 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 241 transitions. [2019-09-20 13:28:05,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,277 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 241 transitions. [2019-09-20 13:28:05,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:28:05,284 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,284 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] [2019-09-20 13:28:05,287 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,287 INFO L82 PathProgramCache]: Analyzing trace with hash 181445729, now seen corresponding path program 1 times [2019-09-20 13:28:05,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,470 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:05,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,472 INFO L87 Difference]: Start difference. First operand 157 states and 241 transitions. Second operand 4 states. [2019-09-20 13:28:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,774 INFO L93 Difference]: Finished difference Result 173 states and 260 transitions. [2019-09-20 13:28:05,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:28:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,777 INFO L225 Difference]: With dead ends: 173 [2019-09-20 13:28:05,777 INFO L226 Difference]: Without dead ends: 173 [2019-09-20 13:28:05,778 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,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-20 13:28:05,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2019-09-20 13:28:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-09-20 13:28:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 240 transitions. [2019-09-20 13:28:05,786 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 240 transitions. Word has length 62 [2019-09-20 13:28:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,787 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 240 transitions. [2019-09-20 13:28:05,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 240 transitions. [2019-09-20 13:28:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:28:05,789 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,790 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] [2019-09-20 13:28:05,790 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,790 INFO L82 PathProgramCache]: Analyzing trace with hash -866065075, now seen corresponding path program 1 times [2019-09-20 13:28:05,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,871 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:05,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:05,872 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,874 INFO L87 Difference]: Start difference. First operand 157 states and 240 transitions. Second operand 5 states. [2019-09-20 13:28:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,357 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2019-09-20 13:28:06,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:28:06,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-09-20 13:28:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,363 INFO L225 Difference]: With dead ends: 178 [2019-09-20 13:28:06,364 INFO L226 Difference]: Without dead ends: 178 [2019-09-20 13:28:06,364 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:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-09-20 13:28:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2019-09-20 13:28:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-20 13:28:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2019-09-20 13:28:06,373 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 62 [2019-09-20 13:28:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,375 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2019-09-20 13:28:06,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2019-09-20 13:28:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:28:06,383 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,384 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] [2019-09-20 13:28:06,384 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1943028885, now seen corresponding path program 1 times [2019-09-20 13:28:06,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,545 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:06,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,547 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand 4 states. [2019-09-20 13:28:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,896 INFO L93 Difference]: Finished difference Result 192 states and 284 transitions. [2019-09-20 13:28:06,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:28:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,898 INFO L225 Difference]: With dead ends: 192 [2019-09-20 13:28:06,898 INFO L226 Difference]: Without dead ends: 192 [2019-09-20 13:28:06,899 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,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-20 13:28:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 177. [2019-09-20 13:28:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-20 13:28:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 266 transitions. [2019-09-20 13:28:06,907 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 266 transitions. Word has length 62 [2019-09-20 13:28:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,907 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 266 transitions. [2019-09-20 13:28:06,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 266 transitions. [2019-09-20 13:28:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:28:06,909 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,909 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] [2019-09-20 13:28:06,910 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1802302198, now seen corresponding path program 1 times [2019-09-20 13:28:06,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,977 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:06,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,978 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,979 INFO L87 Difference]: Start difference. First operand 177 states and 266 transitions. Second operand 4 states. [2019-09-20 13:28:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,245 INFO L93 Difference]: Finished difference Result 190 states and 281 transitions. [2019-09-20 13:28:07,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:28:07,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,247 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:28:07,247 INFO L226 Difference]: Without dead ends: 190 [2019-09-20 13:28:07,248 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,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-20 13:28:07,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2019-09-20 13:28:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-20 13:28:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 265 transitions. [2019-09-20 13:28:07,254 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 265 transitions. Word has length 62 [2019-09-20 13:28:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,255 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 265 transitions. [2019-09-20 13:28:07,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 265 transitions. [2019-09-20 13:28:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:07,256 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,256 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] [2019-09-20 13:28:07,257 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1995085656, now seen corresponding path program 1 times [2019-09-20 13:28:07,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,331 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:07,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,333 INFO L87 Difference]: Start difference. First operand 177 states and 265 transitions. Second operand 4 states. [2019-09-20 13:28:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,615 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2019-09-20 13:28:07,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,617 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:28:07,617 INFO L226 Difference]: Without dead ends: 190 [2019-09-20 13:28:07,617 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,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-20 13:28:07,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2019-09-20 13:28:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-20 13:28:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 264 transitions. [2019-09-20 13:28:07,623 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 264 transitions. Word has length 63 [2019-09-20 13:28:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,623 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 264 transitions. [2019-09-20 13:28:07,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2019-09-20 13:28:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:07,624 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,624 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] [2019-09-20 13:28:07,625 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1190608295, now seen corresponding path program 1 times [2019-09-20 13:28:07,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,700 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:07,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,700 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,701 INFO L87 Difference]: Start difference. First operand 177 states and 264 transitions. Second operand 4 states. [2019-09-20 13:28:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,981 INFO L93 Difference]: Finished difference Result 190 states and 279 transitions. [2019-09-20 13:28:07,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:07,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,983 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:28:07,983 INFO L226 Difference]: Without dead ends: 190 [2019-09-20 13:28:07,984 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,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-20 13:28:07,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2019-09-20 13:28:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-20 13:28:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 263 transitions. [2019-09-20 13:28:07,990 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 263 transitions. Word has length 64 [2019-09-20 13:28:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,990 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 263 transitions. [2019-09-20 13:28:07,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 263 transitions. [2019-09-20 13:28:07,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:28:07,992 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,992 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] [2019-09-20 13:28:07,992 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,993 INFO L82 PathProgramCache]: Analyzing trace with hash 101889725, now seen corresponding path program 1 times [2019-09-20 13:28:07,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,049 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,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,051 INFO L87 Difference]: Start difference. First operand 177 states and 263 transitions. Second operand 4 states. [2019-09-20 13:28:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,332 INFO L93 Difference]: Finished difference Result 190 states and 278 transitions. [2019-09-20 13:28:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:28:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,334 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:28:08,335 INFO L226 Difference]: Without dead ends: 190 [2019-09-20 13:28:08,337 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,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-20 13:28:08,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 177. [2019-09-20 13:28:08,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-09-20 13:28:08,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 262 transitions. [2019-09-20 13:28:08,348 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 262 transitions. Word has length 65 [2019-09-20 13:28:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,349 INFO L475 AbstractCegarLoop]: Abstraction has 177 states and 262 transitions. [2019-09-20 13:28:08,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 262 transitions. [2019-09-20 13:28:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:28:08,360 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,361 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] [2019-09-20 13:28:08,361 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1013524354, now seen corresponding path program 1 times [2019-09-20 13:28:08,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,466 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:08,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,466 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,468 INFO L87 Difference]: Start difference. First operand 177 states and 262 transitions. Second operand 4 states. [2019-09-20 13:28:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,758 INFO L93 Difference]: Finished difference Result 219 states and 324 transitions. [2019-09-20 13:28:08,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:28:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,760 INFO L225 Difference]: With dead ends: 219 [2019-09-20 13:28:08,761 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:28:08,761 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:08,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:28:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2019-09-20 13:28:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-20 13:28:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 299 transitions. [2019-09-20 13:28:08,767 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 299 transitions. Word has length 65 [2019-09-20 13:28:08,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,768 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 299 transitions. [2019-09-20 13:28:08,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 299 transitions. [2019-09-20 13:28:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:08,769 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,769 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] [2019-09-20 13:28:08,769 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1515581922, now seen corresponding path program 1 times [2019-09-20 13:28:08,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,822 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:08,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,824 INFO L87 Difference]: Start difference. First operand 199 states and 299 transitions. Second operand 4 states. [2019-09-20 13:28:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,078 INFO L93 Difference]: Finished difference Result 202 states and 302 transitions. [2019-09-20 13:28:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,081 INFO L225 Difference]: With dead ends: 202 [2019-09-20 13:28:09,082 INFO L226 Difference]: Without dead ends: 202 [2019-09-20 13:28:09,082 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,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-20 13:28:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2019-09-20 13:28:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-20 13:28:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2019-09-20 13:28:09,089 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 66 [2019-09-20 13:28:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,089 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2019-09-20 13:28:09,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2019-09-20 13:28:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-20 13:28:09,091 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,091 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] [2019-09-20 13:28:09,092 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1769721649, now seen corresponding path program 1 times [2019-09-20 13:28:09,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,161 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,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,163 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand 4 states. [2019-09-20 13:28:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,483 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2019-09-20 13:28:09,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-20 13:28:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,486 INFO L225 Difference]: With dead ends: 219 [2019-09-20 13:28:09,486 INFO L226 Difference]: Without dead ends: 219 [2019-09-20 13:28:09,486 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,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-09-20 13:28:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 199. [2019-09-20 13:28:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-20 13:28:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 297 transitions. [2019-09-20 13:28:09,493 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 297 transitions. Word has length 78 [2019-09-20 13:28:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,493 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 297 transitions. [2019-09-20 13:28:09,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 297 transitions. [2019-09-20 13:28:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:28:09,495 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,495 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] [2019-09-20 13:28:09,495 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1535119527, now seen corresponding path program 1 times [2019-09-20 13:28:09,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,551 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:09,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,556 INFO L87 Difference]: Start difference. First operand 199 states and 297 transitions. Second operand 4 states. [2019-09-20 13:28:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,846 INFO L93 Difference]: Finished difference Result 218 states and 320 transitions. [2019-09-20 13:28:09,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:28:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,849 INFO L225 Difference]: With dead ends: 218 [2019-09-20 13:28:09,849 INFO L226 Difference]: Without dead ends: 218 [2019-09-20 13:28:09,849 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,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-20 13:28:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 199. [2019-09-20 13:28:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-20 13:28:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 296 transitions. [2019-09-20 13:28:09,855 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 296 transitions. Word has length 79 [2019-09-20 13:28:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,856 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 296 transitions. [2019-09-20 13:28:09,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 296 transitions. [2019-09-20 13:28:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:28:09,857 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,857 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] [2019-09-20 13:28:09,858 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1675846214, now seen corresponding path program 1 times [2019-09-20 13:28:09,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,921 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:09,921 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,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,922 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 199 states and 296 transitions. Second operand 4 states. [2019-09-20 13:28:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,217 INFO L93 Difference]: Finished difference Result 216 states and 317 transitions. [2019-09-20 13:28:10,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:28:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,219 INFO L225 Difference]: With dead ends: 216 [2019-09-20 13:28:10,220 INFO L226 Difference]: Without dead ends: 216 [2019-09-20 13:28:10,220 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,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-20 13:28:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2019-09-20 13:28:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-20 13:28:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 295 transitions. [2019-09-20 13:28:10,226 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 295 transitions. Word has length 79 [2019-09-20 13:28:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,226 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 295 transitions. [2019-09-20 13:28:10,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 295 transitions. [2019-09-20 13:28:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:10,228 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,228 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] [2019-09-20 13:28:10,228 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1546667284, now seen corresponding path program 1 times [2019-09-20 13:28:10,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,287 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:10,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,288 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,289 INFO L87 Difference]: Start difference. First operand 199 states and 295 transitions. Second operand 4 states. [2019-09-20 13:28:10,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,557 INFO L93 Difference]: Finished difference Result 216 states and 316 transitions. [2019-09-20 13:28:10,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:10,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,559 INFO L225 Difference]: With dead ends: 216 [2019-09-20 13:28:10,559 INFO L226 Difference]: Without dead ends: 216 [2019-09-20 13:28:10,560 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:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-20 13:28:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2019-09-20 13:28:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-20 13:28:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 294 transitions. [2019-09-20 13:28:10,566 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 294 transitions. Word has length 80 [2019-09-20 13:28:10,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,567 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 294 transitions. [2019-09-20 13:28:10,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 294 transitions. [2019-09-20 13:28:10,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:10,568 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,568 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] [2019-09-20 13:28:10,569 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2088291357, now seen corresponding path program 1 times [2019-09-20 13:28:10,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,662 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:10,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,664 INFO L87 Difference]: Start difference. First operand 199 states and 294 transitions. Second operand 4 states. [2019-09-20 13:28:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,017 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2019-09-20 13:28:11,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,020 INFO L225 Difference]: With dead ends: 216 [2019-09-20 13:28:11,020 INFO L226 Difference]: Without dead ends: 216 [2019-09-20 13:28:11,021 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,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-20 13:28:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2019-09-20 13:28:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-20 13:28:11,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 293 transitions. [2019-09-20 13:28:11,029 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 293 transitions. Word has length 81 [2019-09-20 13:28:11,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,030 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 293 transitions. [2019-09-20 13:28:11,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 293 transitions. [2019-09-20 13:28:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:28:11,032 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,032 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] [2019-09-20 13:28:11,032 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1331436167, now seen corresponding path program 1 times [2019-09-20 13:28:11,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,105 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,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,106 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,107 INFO L87 Difference]: Start difference. First operand 199 states and 293 transitions. Second operand 4 states. [2019-09-20 13:28:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,478 INFO L93 Difference]: Finished difference Result 216 states and 314 transitions. [2019-09-20 13:28:11,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:28:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,481 INFO L225 Difference]: With dead ends: 216 [2019-09-20 13:28:11,481 INFO L226 Difference]: Without dead ends: 216 [2019-09-20 13:28:11,482 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:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-20 13:28:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 199. [2019-09-20 13:28:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-20 13:28:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 292 transitions. [2019-09-20 13:28:11,492 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 292 transitions. Word has length 82 [2019-09-20 13:28:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,492 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 292 transitions. [2019-09-20 13:28:11,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 292 transitions. [2019-09-20 13:28:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:28:11,495 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,495 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] [2019-09-20 13:28:11,495 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1295955682, now seen corresponding path program 1 times [2019-09-20 13:28:11,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,621 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:11,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,621 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,623 INFO L87 Difference]: Start difference. First operand 199 states and 292 transitions. Second operand 4 states. [2019-09-20 13:28:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,964 INFO L93 Difference]: Finished difference Result 206 states and 301 transitions. [2019-09-20 13:28:11,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:28:11,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,966 INFO L225 Difference]: With dead ends: 206 [2019-09-20 13:28:11,966 INFO L226 Difference]: Without dead ends: 206 [2019-09-20 13:28:11,966 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,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-20 13:28:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 199. [2019-09-20 13:28:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-20 13:28:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2019-09-20 13:28:11,972 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 83 [2019-09-20 13:28:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,973 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2019-09-20 13:28:11,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2019-09-20 13:28:11,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:28:11,974 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,974 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] [2019-09-20 13:28:11,975 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,975 INFO L82 PathProgramCache]: Analyzing trace with hash -738982646, now seen corresponding path program 1 times [2019-09-20 13:28:11,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,066 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,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,069 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand 4 states. [2019-09-20 13:28:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,507 INFO L93 Difference]: Finished difference Result 309 states and 460 transitions. [2019-09-20 13:28:12,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:28:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,510 INFO L225 Difference]: With dead ends: 309 [2019-09-20 13:28:12,510 INFO L226 Difference]: Without dead ends: 309 [2019-09-20 13:28:12,511 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:12,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-20 13:28:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 240. [2019-09-20 13:28:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-20 13:28:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 364 transitions. [2019-09-20 13:28:12,518 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 364 transitions. Word has length 87 [2019-09-20 13:28:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,519 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 364 transitions. [2019-09-20 13:28:12,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 364 transitions. [2019-09-20 13:28:12,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-20 13:28:12,520 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,521 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] [2019-09-20 13:28:12,521 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash -2110789944, now seen corresponding path program 1 times [2019-09-20 13:28:12,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,604 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,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,606 INFO L87 Difference]: Start difference. First operand 240 states and 364 transitions. Second operand 4 states. [2019-09-20 13:28:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,034 INFO L93 Difference]: Finished difference Result 289 states and 437 transitions. [2019-09-20 13:28:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-20 13:28:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,038 INFO L225 Difference]: With dead ends: 289 [2019-09-20 13:28:13,038 INFO L226 Difference]: Without dead ends: 289 [2019-09-20 13:28:13,039 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,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-20 13:28:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 264. [2019-09-20 13:28:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-20 13:28:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 405 transitions. [2019-09-20 13:28:13,051 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 405 transitions. Word has length 87 [2019-09-20 13:28:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,052 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 405 transitions. [2019-09-20 13:28:13,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 405 transitions. [2019-09-20 13:28:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:28:13,055 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,055 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] [2019-09-20 13:28:13,055 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1673898258, now seen corresponding path program 1 times [2019-09-20 13:28:13,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,190 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,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,193 INFO L87 Difference]: Start difference. First operand 264 states and 405 transitions. Second operand 4 states. [2019-09-20 13:28:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,670 INFO L93 Difference]: Finished difference Result 326 states and 491 transitions. [2019-09-20 13:28:13,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:28:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,672 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:28:13,673 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:28:13,673 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,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:28:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 265. [2019-09-20 13:28:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 406 transitions. [2019-09-20 13:28:13,683 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 406 transitions. Word has length 88 [2019-09-20 13:28:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,683 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 406 transitions. [2019-09-20 13:28:13,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 406 transitions. [2019-09-20 13:28:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:28:13,685 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,685 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] [2019-09-20 13:28:13,686 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1009804837, now seen corresponding path program 1 times [2019-09-20 13:28:13,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,795 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:13,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,797 INFO L87 Difference]: Start difference. First operand 265 states and 406 transitions. Second operand 4 states. [2019-09-20 13:28:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,250 INFO L93 Difference]: Finished difference Result 326 states and 490 transitions. [2019-09-20 13:28:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:28:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,254 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:28:14,255 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:28:14,256 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,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:28:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 265. [2019-09-20 13:28:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 405 transitions. [2019-09-20 13:28:14,263 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 405 transitions. Word has length 100 [2019-09-20 13:28:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,264 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 405 transitions. [2019-09-20 13:28:14,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 405 transitions. [2019-09-20 13:28:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-20 13:28:14,265 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,266 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] [2019-09-20 13:28:14,266 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1453705511, now seen corresponding path program 1 times [2019-09-20 13:28:14,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,350 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,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,352 INFO L87 Difference]: Start difference. First operand 265 states and 405 transitions. Second operand 4 states. [2019-09-20 13:28:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,675 INFO L93 Difference]: Finished difference Result 290 states and 436 transitions. [2019-09-20 13:28:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-09-20 13:28:14,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,678 INFO L225 Difference]: With dead ends: 290 [2019-09-20 13:28:14,678 INFO L226 Difference]: Without dead ends: 290 [2019-09-20 13:28:14,678 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,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-09-20 13:28:14,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 265. [2019-09-20 13:28:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2019-09-20 13:28:14,686 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 100 [2019-09-20 13:28:14,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,686 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2019-09-20 13:28:14,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2019-09-20 13:28:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:14,688 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,688 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] [2019-09-20 13:28:14,688 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 677263077, now seen corresponding path program 1 times [2019-09-20 13:28:14,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,841 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:14,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,844 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand 4 states. [2019-09-20 13:28:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,301 INFO L93 Difference]: Finished difference Result 325 states and 487 transitions. [2019-09-20 13:28:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,305 INFO L225 Difference]: With dead ends: 325 [2019-09-20 13:28:15,305 INFO L226 Difference]: Without dead ends: 325 [2019-09-20 13:28:15,306 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,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-20 13:28:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 265. [2019-09-20 13:28:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:15,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 403 transitions. [2019-09-20 13:28:15,315 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 403 transitions. Word has length 101 [2019-09-20 13:28:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,315 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 403 transitions. [2019-09-20 13:28:15,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 403 transitions. [2019-09-20 13:28:15,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:15,318 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,318 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] [2019-09-20 13:28:15,318 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash 536536390, now seen corresponding path program 1 times [2019-09-20 13:28:15,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,401 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:15,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,403 INFO L87 Difference]: Start difference. First operand 265 states and 403 transitions. Second operand 4 states. [2019-09-20 13:28:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,809 INFO L93 Difference]: Finished difference Result 323 states and 484 transitions. [2019-09-20 13:28:15,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,811 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:28:15,812 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:28:15,812 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,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:28:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2019-09-20 13:28:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2019-09-20 13:28:15,819 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 101 [2019-09-20 13:28:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,820 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2019-09-20 13:28:15,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2019-09-20 13:28:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:15,821 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,822 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] [2019-09-20 13:28:15,822 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1553282083, now seen corresponding path program 1 times [2019-09-20 13:28:15,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,888 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,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,888 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,890 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand 4 states. [2019-09-20 13:28:16,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,241 INFO L93 Difference]: Finished difference Result 289 states and 432 transitions. [2019-09-20 13:28:16,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:16,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,245 INFO L225 Difference]: With dead ends: 289 [2019-09-20 13:28:16,245 INFO L226 Difference]: Without dead ends: 289 [2019-09-20 13:28:16,245 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,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-20 13:28:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2019-09-20 13:28:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 401 transitions. [2019-09-20 13:28:16,254 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 401 transitions. Word has length 101 [2019-09-20 13:28:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,255 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 401 transitions. [2019-09-20 13:28:16,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 401 transitions. [2019-09-20 13:28:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:16,257 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,258 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] [2019-09-20 13:28:16,258 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1412555396, now seen corresponding path program 1 times [2019-09-20 13:28:16,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,261 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,332 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,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,333 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,334 INFO L87 Difference]: Start difference. First operand 265 states and 401 transitions. Second operand 4 states. [2019-09-20 13:28:16,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,637 INFO L93 Difference]: Finished difference Result 287 states and 429 transitions. [2019-09-20 13:28:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,641 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:16,641 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:16,642 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,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:16,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-09-20 13:28:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:16,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 400 transitions. [2019-09-20 13:28:16,654 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 400 transitions. Word has length 101 [2019-09-20 13:28:16,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,654 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 400 transitions. [2019-09-20 13:28:16,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,655 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 400 transitions. [2019-09-20 13:28:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:16,657 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,658 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] [2019-09-20 13:28:16,658 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1411051272, now seen corresponding path program 1 times [2019-09-20 13:28:16,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,755 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:16,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,758 INFO L87 Difference]: Start difference. First operand 265 states and 400 transitions. Second operand 4 states. [2019-09-20 13:28:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,225 INFO L93 Difference]: Finished difference Result 323 states and 481 transitions. [2019-09-20 13:28:17,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,231 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:28:17,232 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:28:17,232 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:17,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:28:17,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2019-09-20 13:28:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2019-09-20 13:28:17,238 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 102 [2019-09-20 13:28:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,239 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2019-09-20 13:28:17,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2019-09-20 13:28:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:17,240 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,240 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] [2019-09-20 13:28:17,241 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1497130614, now seen corresponding path program 1 times [2019-09-20 13:28:17,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,295 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,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,296 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand 4 states. [2019-09-20 13:28:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,581 INFO L93 Difference]: Finished difference Result 287 states and 427 transitions. [2019-09-20 13:28:17,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:17,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,584 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:17,584 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:17,584 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,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-09-20 13:28:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 398 transitions. [2019-09-20 13:28:17,591 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 398 transitions. Word has length 102 [2019-09-20 13:28:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,592 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 398 transitions. [2019-09-20 13:28:17,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 398 transitions. [2019-09-20 13:28:17,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:17,593 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,593 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] [2019-09-20 13:28:17,593 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,594 INFO L82 PathProgramCache]: Analyzing trace with hash -2115805015, now seen corresponding path program 1 times [2019-09-20 13:28:17,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,657 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:17,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,658 INFO L87 Difference]: Start difference. First operand 265 states and 398 transitions. Second operand 4 states. [2019-09-20 13:28:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,044 INFO L93 Difference]: Finished difference Result 323 states and 479 transitions. [2019-09-20 13:28:18,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,046 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:28:18,047 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:28:18,047 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,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:28:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2019-09-20 13:28:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 397 transitions. [2019-09-20 13:28:18,055 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 397 transitions. Word has length 103 [2019-09-20 13:28:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,055 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 397 transitions. [2019-09-20 13:28:18,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 397 transitions. [2019-09-20 13:28:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:18,057 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,057 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] [2019-09-20 13:28:18,058 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2075130265, now seen corresponding path program 1 times [2019-09-20 13:28:18,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,133 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,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,135 INFO L87 Difference]: Start difference. First operand 265 states and 397 transitions. Second operand 4 states. [2019-09-20 13:28:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,478 INFO L93 Difference]: Finished difference Result 287 states and 425 transitions. [2019-09-20 13:28:18,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,481 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:18,482 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:18,482 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,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:18,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-09-20 13:28:18,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 396 transitions. [2019-09-20 13:28:18,491 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 396 transitions. Word has length 103 [2019-09-20 13:28:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,492 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 396 transitions. [2019-09-20 13:28:18,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 396 transitions. [2019-09-20 13:28:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:18,494 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,494 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] [2019-09-20 13:28:18,495 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1485562477, now seen corresponding path program 1 times [2019-09-20 13:28:18,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,586 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:18,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,588 INFO L87 Difference]: Start difference. First operand 265 states and 396 transitions. Second operand 4 states. [2019-09-20 13:28:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,003 INFO L93 Difference]: Finished difference Result 323 states and 477 transitions. [2019-09-20 13:28:19,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,005 INFO L225 Difference]: With dead ends: 323 [2019-09-20 13:28:19,005 INFO L226 Difference]: Without dead ends: 323 [2019-09-20 13:28:19,005 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,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-20 13:28:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 265. [2019-09-20 13:28:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:19,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 395 transitions. [2019-09-20 13:28:19,011 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 395 transitions. Word has length 104 [2019-09-20 13:28:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,012 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 395 transitions. [2019-09-20 13:28:19,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,012 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 395 transitions. [2019-09-20 13:28:19,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:19,015 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,015 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] [2019-09-20 13:28:19,015 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1548487569, now seen corresponding path program 1 times [2019-09-20 13:28:19,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,082 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,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,084 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,087 INFO L87 Difference]: Start difference. First operand 265 states and 395 transitions. Second operand 4 states. [2019-09-20 13:28:19,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,390 INFO L93 Difference]: Finished difference Result 287 states and 423 transitions. [2019-09-20 13:28:19,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:19,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,393 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:19,393 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:19,394 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,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2019-09-20 13:28:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 394 transitions. [2019-09-20 13:28:19,400 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 394 transitions. Word has length 104 [2019-09-20 13:28:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,401 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 394 transitions. [2019-09-20 13:28:19,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 394 transitions. [2019-09-20 13:28:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:19,402 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,402 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] [2019-09-20 13:28:19,402 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1571399570, now seen corresponding path program 1 times [2019-09-20 13:28:19,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,469 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:19,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,471 INFO L87 Difference]: Start difference. First operand 265 states and 394 transitions. Second operand 4 states. [2019-09-20 13:28:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,850 INFO L93 Difference]: Finished difference Result 313 states and 463 transitions. [2019-09-20 13:28:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,853 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:28:19,853 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:28:19,853 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,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:28:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2019-09-20 13:28:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 393 transitions. [2019-09-20 13:28:19,859 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 393 transitions. Word has length 105 [2019-09-20 13:28:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,859 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 393 transitions. [2019-09-20 13:28:19,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 393 transitions. [2019-09-20 13:28:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:19,860 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,861 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] [2019-09-20 13:28:19,861 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1137670484, now seen corresponding path program 1 times [2019-09-20 13:28:19,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,920 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:19,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,922 INFO L87 Difference]: Start difference. First operand 265 states and 393 transitions. Second operand 4 states. [2019-09-20 13:28:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,187 INFO L93 Difference]: Finished difference Result 277 states and 409 transitions. [2019-09-20 13:28:20,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,189 INFO L225 Difference]: With dead ends: 277 [2019-09-20 13:28:20,189 INFO L226 Difference]: Without dead ends: 277 [2019-09-20 13:28:20,190 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,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-09-20 13:28:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 265. [2019-09-20 13:28:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 392 transitions. [2019-09-20 13:28:20,195 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 392 transitions. Word has length 105 [2019-09-20 13:28:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,196 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 392 transitions. [2019-09-20 13:28:20,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 392 transitions. [2019-09-20 13:28:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:28:20,197 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,197 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] [2019-09-20 13:28:20,197 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1490379256, now seen corresponding path program 1 times [2019-09-20 13:28:20,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,266 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:20,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,268 INFO L87 Difference]: Start difference. First operand 265 states and 392 transitions. Second operand 4 states. [2019-09-20 13:28:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,634 INFO L93 Difference]: Finished difference Result 313 states and 461 transitions. [2019-09-20 13:28:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-20 13:28:20,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,637 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:28:20,638 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:28:20,638 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,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:28:20,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 265. [2019-09-20 13:28:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-20 13:28:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 391 transitions. [2019-09-20 13:28:20,645 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 391 transitions. Word has length 109 [2019-09-20 13:28:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,645 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 391 transitions. [2019-09-20 13:28:20,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 391 transitions. [2019-09-20 13:28:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-20 13:28:20,646 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,646 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] [2019-09-20 13:28:20,647 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,647 INFO L82 PathProgramCache]: Analyzing trace with hash -811107002, now seen corresponding path program 1 times [2019-09-20 13:28:20,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:20,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,734 INFO L87 Difference]: Start difference. First operand 265 states and 391 transitions. Second operand 4 states. [2019-09-20 13:28:21,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,088 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2019-09-20 13:28:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-20 13:28:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,091 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:21,091 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:21,091 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:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2019-09-20 13:28:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 436 transitions. [2019-09-20 13:28:21,100 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 436 transitions. Word has length 109 [2019-09-20 13:28:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,102 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 436 transitions. [2019-09-20 13:28:21,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 436 transitions. [2019-09-20 13:28:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-20 13:28:21,104 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,105 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,105 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash 276441320, now seen corresponding path program 1 times [2019-09-20 13:28:21,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:21,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,198 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,199 INFO L87 Difference]: Start difference. First operand 291 states and 436 transitions. Second operand 4 states. [2019-09-20 13:28:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,552 INFO L93 Difference]: Finished difference Result 339 states and 505 transitions. [2019-09-20 13:28:21,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-20 13:28:21,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,555 INFO L225 Difference]: With dead ends: 339 [2019-09-20 13:28:21,556 INFO L226 Difference]: Without dead ends: 339 [2019-09-20 13:28:21,556 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,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-09-20 13:28:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 291. [2019-09-20 13:28:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 435 transitions. [2019-09-20 13:28:21,564 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 435 transitions. Word has length 112 [2019-09-20 13:28:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,564 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 435 transitions. [2019-09-20 13:28:21,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 435 transitions. [2019-09-20 13:28:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:28:21,566 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,566 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,566 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2133224009, now seen corresponding path program 1 times [2019-09-20 13:28:21,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,641 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:21,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,641 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,642 INFO L87 Difference]: Start difference. First operand 291 states and 435 transitions. Second operand 4 states. [2019-09-20 13:28:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,975 INFO L93 Difference]: Finished difference Result 331 states and 491 transitions. [2019-09-20 13:28:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-20 13:28:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,977 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:28:21,977 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:28:21,978 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,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:28:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2019-09-20 13:28:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 434 transitions. [2019-09-20 13:28:21,984 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 434 transitions. Word has length 113 [2019-09-20 13:28:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,985 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 434 transitions. [2019-09-20 13:28:21,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,985 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 434 transitions. [2019-09-20 13:28:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:28:21,986 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,987 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1030634824, now seen corresponding path program 1 times [2019-09-20 13:28:21,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:22,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,077 INFO L87 Difference]: Start difference. First operand 291 states and 434 transitions. Second operand 4 states. [2019-09-20 13:28:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,441 INFO L93 Difference]: Finished difference Result 331 states and 490 transitions. [2019-09-20 13:28:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:28:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,447 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:28:22,448 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:28:22,448 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:28:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2019-09-20 13:28:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 433 transitions. [2019-09-20 13:28:22,453 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 433 transitions. Word has length 114 [2019-09-20 13:28:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,454 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 433 transitions. [2019-09-20 13:28:22,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 433 transitions. [2019-09-20 13:28:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:28:22,455 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,456 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1294274259, now seen corresponding path program 1 times [2019-09-20 13:28:22,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,530 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:22,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,530 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,531 INFO L87 Difference]: Start difference. First operand 291 states and 433 transitions. Second operand 4 states. [2019-09-20 13:28:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,882 INFO L93 Difference]: Finished difference Result 331 states and 489 transitions. [2019-09-20 13:28:22,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-20 13:28:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,885 INFO L225 Difference]: With dead ends: 331 [2019-09-20 13:28:22,885 INFO L226 Difference]: Without dead ends: 331 [2019-09-20 13:28:22,885 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:22,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-20 13:28:22,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 291. [2019-09-20 13:28:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 432 transitions. [2019-09-20 13:28:22,892 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 432 transitions. Word has length 115 [2019-09-20 13:28:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,892 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 432 transitions. [2019-09-20 13:28:22,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 432 transitions. [2019-09-20 13:28:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:28:22,894 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,894 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1775596791, now seen corresponding path program 1 times [2019-09-20 13:28:22,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:22,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,999 INFO L87 Difference]: Start difference. First operand 291 states and 432 transitions. Second operand 4 states. [2019-09-20 13:28:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,332 INFO L93 Difference]: Finished difference Result 329 states and 486 transitions. [2019-09-20 13:28:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-20 13:28:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,336 INFO L225 Difference]: With dead ends: 329 [2019-09-20 13:28:23,337 INFO L226 Difference]: Without dead ends: 329 [2019-09-20 13:28:23,337 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:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-20 13:28:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 291. [2019-09-20 13:28:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:23,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 431 transitions. [2019-09-20 13:28:23,342 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 431 transitions. Word has length 115 [2019-09-20 13:28:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,343 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 431 transitions. [2019-09-20 13:28:23,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 431 transitions. [2019-09-20 13:28:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:28:23,344 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,344 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,345 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1729140110, now seen corresponding path program 1 times [2019-09-20 13:28:23,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:23,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,420 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,421 INFO L87 Difference]: Start difference. First operand 291 states and 431 transitions. Second operand 4 states. [2019-09-20 13:28:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,770 INFO L93 Difference]: Finished difference Result 327 states and 482 transitions. [2019-09-20 13:28:23,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-20 13:28:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,772 INFO L225 Difference]: With dead ends: 327 [2019-09-20 13:28:23,773 INFO L226 Difference]: Without dead ends: 327 [2019-09-20 13:28:23,773 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:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-20 13:28:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 291. [2019-09-20 13:28:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 430 transitions. [2019-09-20 13:28:23,782 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 430 transitions. Word has length 116 [2019-09-20 13:28:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,782 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 430 transitions. [2019-09-20 13:28:23,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 430 transitions. [2019-09-20 13:28:23,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:28:23,783 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,784 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,784 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1157338966, now seen corresponding path program 1 times [2019-09-20 13:28:23,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:23,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,855 INFO L87 Difference]: Start difference. First operand 291 states and 430 transitions. Second operand 4 states. [2019-09-20 13:28:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,165 INFO L93 Difference]: Finished difference Result 324 states and 477 transitions. [2019-09-20 13:28:24,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-20 13:28:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,167 INFO L225 Difference]: With dead ends: 324 [2019-09-20 13:28:24,168 INFO L226 Difference]: Without dead ends: 324 [2019-09-20 13:28:24,168 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:24,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-20 13:28:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2019-09-20 13:28:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 429 transitions. [2019-09-20 13:28:24,173 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 429 transitions. Word has length 116 [2019-09-20 13:28:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,174 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 429 transitions. [2019-09-20 13:28:24,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 429 transitions. [2019-09-20 13:28:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:28:24,175 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,175 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1621463217, now seen corresponding path program 1 times [2019-09-20 13:28:24,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:24,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,247 INFO L87 Difference]: Start difference. First operand 291 states and 429 transitions. Second operand 4 states. [2019-09-20 13:28:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,585 INFO L93 Difference]: Finished difference Result 324 states and 476 transitions. [2019-09-20 13:28:24,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-20 13:28:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,588 INFO L225 Difference]: With dead ends: 324 [2019-09-20 13:28:24,588 INFO L226 Difference]: Without dead ends: 324 [2019-09-20 13:28:24,588 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:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-20 13:28:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 291. [2019-09-20 13:28:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 428 transitions. [2019-09-20 13:28:24,593 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 428 transitions. Word has length 119 [2019-09-20 13:28:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,594 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 428 transitions. [2019-09-20 13:28:24,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,594 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 428 transitions. [2019-09-20 13:28:24,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:28:24,595 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,596 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash 435271861, now seen corresponding path program 1 times [2019-09-20 13:28:24,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:24,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,670 INFO L87 Difference]: Start difference. First operand 291 states and 428 transitions. Second operand 4 states. [2019-09-20 13:28:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,999 INFO L93 Difference]: Finished difference Result 318 states and 466 transitions. [2019-09-20 13:28:24,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-20 13:28:25,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,002 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:25,002 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:25,003 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:25,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:25,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2019-09-20 13:28:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 427 transitions. [2019-09-20 13:28:25,011 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 427 transitions. Word has length 120 [2019-09-20 13:28:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,012 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 427 transitions. [2019-09-20 13:28:25,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 427 transitions. [2019-09-20 13:28:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:28:25,014 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,014 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,015 INFO L82 PathProgramCache]: Analyzing trace with hash -407228904, now seen corresponding path program 1 times [2019-09-20 13:28:25,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:25,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,112 INFO L87 Difference]: Start difference. First operand 291 states and 427 transitions. Second operand 4 states. [2019-09-20 13:28:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,467 INFO L93 Difference]: Finished difference Result 318 states and 465 transitions. [2019-09-20 13:28:25,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-20 13:28:25,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,469 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:25,469 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:25,470 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:25,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 291. [2019-09-20 13:28:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 426 transitions. [2019-09-20 13:28:25,475 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 426 transitions. Word has length 120 [2019-09-20 13:28:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,475 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 426 transitions. [2019-09-20 13:28:25,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 426 transitions. [2019-09-20 13:28:25,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:28:25,476 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,477 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash -147572236, now seen corresponding path program 1 times [2019-09-20 13:28:25,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:25,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,554 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,555 INFO L87 Difference]: Start difference. First operand 291 states and 426 transitions. Second operand 4 states. [2019-09-20 13:28:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,877 INFO L93 Difference]: Finished difference Result 315 states and 460 transitions. [2019-09-20 13:28:25,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:28:25,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,884 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:28:25,885 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:28:25,885 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:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:28:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2019-09-20 13:28:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 425 transitions. [2019-09-20 13:28:25,893 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 425 transitions. Word has length 121 [2019-09-20 13:28:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,893 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 425 transitions. [2019-09-20 13:28:25,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 425 transitions. [2019-09-20 13:28:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:28:25,894 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,895 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1045845024, now seen corresponding path program 1 times [2019-09-20 13:28:25,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,967 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:25,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,969 INFO L87 Difference]: Start difference. First operand 291 states and 425 transitions. Second operand 4 states. [2019-09-20 13:28:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,276 INFO L93 Difference]: Finished difference Result 315 states and 459 transitions. [2019-09-20 13:28:26,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:28:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,278 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:28:26,278 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:28:26,278 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:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:28:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 291. [2019-09-20 13:28:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-09-20 13:28:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2019-09-20 13:28:26,283 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 122 [2019-09-20 13:28:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,283 INFO L475 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2019-09-20 13:28:26,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2019-09-20 13:28:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:28:26,285 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,285 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:26,285 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash 31141737, now seen corresponding path program 1 times [2019-09-20 13:28:26,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-20 13:28:26,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,359 INFO L87 Difference]: Start difference. First operand 291 states and 424 transitions. Second operand 4 states. [2019-09-20 13:28:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,734 INFO L93 Difference]: Finished difference Result 363 states and 535 transitions. [2019-09-20 13:28:26,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:28:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,737 INFO L225 Difference]: With dead ends: 363 [2019-09-20 13:28:26,737 INFO L226 Difference]: Without dead ends: 363 [2019-09-20 13:28:26,738 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,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-20 13:28:26,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 323. [2019-09-20 13:28:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-20 13:28:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 481 transitions. [2019-09-20 13:28:26,745 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 481 transitions. Word has length 122 [2019-09-20 13:28:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,746 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 481 transitions. [2019-09-20 13:28:26,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 481 transitions. [2019-09-20 13:28:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:26,747 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,748 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,749 INFO L82 PathProgramCache]: Analyzing trace with hash 2047960092, now seen corresponding path program 1 times [2019-09-20 13:28:26,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:26,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,826 INFO L87 Difference]: Start difference. First operand 323 states and 481 transitions. Second operand 4 states. [2019-09-20 13:28:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,157 INFO L93 Difference]: Finished difference Result 344 states and 511 transitions. [2019-09-20 13:28:27,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,160 INFO L225 Difference]: With dead ends: 344 [2019-09-20 13:28:27,160 INFO L226 Difference]: Without dead ends: 344 [2019-09-20 13:28:27,161 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:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-20 13:28:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 323. [2019-09-20 13:28:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-20 13:28:27,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 480 transitions. [2019-09-20 13:28:27,173 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 480 transitions. Word has length 123 [2019-09-20 13:28:27,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,173 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 480 transitions. [2019-09-20 13:28:27,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,174 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 480 transitions. [2019-09-20 13:28:27,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:27,176 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,176 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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:27,176 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,177 INFO L82 PathProgramCache]: Analyzing trace with hash 403478049, now seen corresponding path program 1 times [2019-09-20 13:28:27,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,237 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:28:27,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,239 INFO L87 Difference]: Start difference. First operand 323 states and 480 transitions. Second operand 4 states. [2019-09-20 13:28:27,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,740 INFO L93 Difference]: Finished difference Result 431 states and 647 transitions. [2019-09-20 13:28:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,743 INFO L225 Difference]: With dead ends: 431 [2019-09-20 13:28:27,743 INFO L226 Difference]: Without dead ends: 431 [2019-09-20 13:28:27,744 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,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-09-20 13:28:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 362. [2019-09-20 13:28:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-20 13:28:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 551 transitions. [2019-09-20 13:28:27,751 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 551 transitions. Word has length 123 [2019-09-20 13:28:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,751 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 551 transitions. [2019-09-20 13:28:27,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 551 transitions. [2019-09-20 13:28:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:28:27,753 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,753 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:27,753 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1513649996, now seen corresponding path program 1 times [2019-09-20 13:28:27,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,829 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:27,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,831 INFO L87 Difference]: Start difference. First operand 362 states and 551 transitions. Second operand 4 states. [2019-09-20 13:28:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,128 INFO L93 Difference]: Finished difference Result 389 states and 585 transitions. [2019-09-20 13:28:28,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:28:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,131 INFO L225 Difference]: With dead ends: 389 [2019-09-20 13:28:28,131 INFO L226 Difference]: Without dead ends: 389 [2019-09-20 13:28:28,131 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,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-09-20 13:28:28,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 362. [2019-09-20 13:28:28,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-20 13:28:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 550 transitions. [2019-09-20 13:28:28,137 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 550 transitions. Word has length 124 [2019-09-20 13:28:28,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,138 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 550 transitions. [2019-09-20 13:28:28,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,138 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 550 transitions. [2019-09-20 13:28:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:28:28,139 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,139 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:28,139 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash -617355081, now seen corresponding path program 1 times [2019-09-20 13:28:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-20 13:28:28,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,219 INFO L87 Difference]: Start difference. First operand 362 states and 550 transitions. Second operand 4 states. [2019-09-20 13:28:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,645 INFO L93 Difference]: Finished difference Result 424 states and 636 transitions. [2019-09-20 13:28:28,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:28:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,647 INFO L225 Difference]: With dead ends: 424 [2019-09-20 13:28:28,647 INFO L226 Difference]: Without dead ends: 424 [2019-09-20 13:28:28,648 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,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-20 13:28:28,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 361. [2019-09-20 13:28:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-20 13:28:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 549 transitions. [2019-09-20 13:28:28,652 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 549 transitions. Word has length 124 [2019-09-20 13:28:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,653 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 549 transitions. [2019-09-20 13:28:28,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 549 transitions. [2019-09-20 13:28:28,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:28:28,654 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,654 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:28,654 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1064755429, now seen corresponding path program 1 times [2019-09-20 13:28:28,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:28,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,728 INFO L87 Difference]: Start difference. First operand 361 states and 549 transitions. Second operand 4 states. [2019-09-20 13:28:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,012 INFO L93 Difference]: Finished difference Result 388 states and 583 transitions. [2019-09-20 13:28:29,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:28:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,015 INFO L225 Difference]: With dead ends: 388 [2019-09-20 13:28:29,015 INFO L226 Difference]: Without dead ends: 388 [2019-09-20 13:28:29,015 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,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-20 13:28:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2019-09-20 13:28:29,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-20 13:28:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 548 transitions. [2019-09-20 13:28:29,021 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 548 transitions. Word has length 125 [2019-09-20 13:28:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,021 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 548 transitions. [2019-09-20 13:28:29,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 548 transitions. [2019-09-20 13:28:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-20 13:28:29,022 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,022 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:29,023 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1298688433, now seen corresponding path program 1 times [2019-09-20 13:28:29,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:29,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,088 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,089 INFO L87 Difference]: Start difference. First operand 361 states and 548 transitions. Second operand 4 states. [2019-09-20 13:28:29,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,396 INFO L93 Difference]: Finished difference Result 388 states and 582 transitions. [2019-09-20 13:28:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-20 13:28:29,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,399 INFO L225 Difference]: With dead ends: 388 [2019-09-20 13:28:29,400 INFO L226 Difference]: Without dead ends: 388 [2019-09-20 13:28:29,400 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,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-09-20 13:28:29,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 361. [2019-09-20 13:28:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-20 13:28:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 547 transitions. [2019-09-20 13:28:29,406 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 547 transitions. Word has length 126 [2019-09-20 13:28:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,406 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 547 transitions. [2019-09-20 13:28:29,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 547 transitions. [2019-09-20 13:28:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:28:29,407 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,408 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:29,408 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1225439658, now seen corresponding path program 1 times [2019-09-20 13:28:29,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:28:29,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,479 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,480 INFO L87 Difference]: Start difference. First operand 361 states and 547 transitions. Second operand 4 states. [2019-09-20 13:28:29,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,756 INFO L93 Difference]: Finished difference Result 378 states and 569 transitions. [2019-09-20 13:28:29,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-20 13:28:29,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,759 INFO L225 Difference]: With dead ends: 378 [2019-09-20 13:28:29,759 INFO L226 Difference]: Without dead ends: 378 [2019-09-20 13:28:29,760 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,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-20 13:28:29,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 361. [2019-09-20 13:28:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-20 13:28:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 546 transitions. [2019-09-20 13:28:29,766 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 546 transitions. Word has length 127 [2019-09-20 13:28:29,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,766 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 546 transitions. [2019-09-20 13:28:29,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,766 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2019-09-20 13:28:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:28:29,767 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,768 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] [2019-09-20 13:28:29,768 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2082154556, now seen corresponding path program 1 times [2019-09-20 13:28:29,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:29,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:28:29,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:28:29,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:28:29,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:28:29,865 INFO L87 Difference]: Start difference. First operand 361 states and 546 transitions. Second operand 3 states. [2019-09-20 13:28:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,922 INFO L93 Difference]: Finished difference Result 693 states and 1047 transitions. [2019-09-20 13:28:29,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:28:29,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-20 13:28:29,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,926 INFO L225 Difference]: With dead ends: 693 [2019-09-20 13:28:29,926 INFO L226 Difference]: Without dead ends: 693 [2019-09-20 13:28:29,927 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:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-09-20 13:28:29,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2019-09-20 13:28:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-20 13:28:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2019-09-20 13:28:29,933 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 128 [2019-09-20 13:28:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,933 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2019-09-20 13:28:29,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:28:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2019-09-20 13:28:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:28:29,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,934 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] [2019-09-20 13:28:29,934 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2048871508, now seen corresponding path program 1 times [2019-09-20 13:28:29,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,003 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:30,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,005 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2019-09-20 13:28:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,456 INFO L93 Difference]: Finished difference Result 903 states and 1368 transitions. [2019-09-20 13:28:30,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:30,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-20 13:28:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,462 INFO L225 Difference]: With dead ends: 903 [2019-09-20 13:28:30,463 INFO L226 Difference]: Without dead ends: 903 [2019-09-20 13:28:30,463 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,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-09-20 13:28:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 769. [2019-09-20 13:28:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-09-20 13:28:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1188 transitions. [2019-09-20 13:28:30,473 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1188 transitions. Word has length 129 [2019-09-20 13:28:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,473 INFO L475 AbstractCegarLoop]: Abstraction has 769 states and 1188 transitions. [2019-09-20 13:28:30,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1188 transitions. [2019-09-20 13:28:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-20 13:28:30,475 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,475 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] [2019-09-20 13:28:30,475 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash 669219980, now seen corresponding path program 1 times [2019-09-20 13:28:30,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,543 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:30,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,543 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,545 INFO L87 Difference]: Start difference. First operand 769 states and 1188 transitions. Second operand 4 states. [2019-09-20 13:28:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,038 INFO L93 Difference]: Finished difference Result 893 states and 1354 transitions. [2019-09-20 13:28:31,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:31,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-20 13:28:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,043 INFO L225 Difference]: With dead ends: 893 [2019-09-20 13:28:31,044 INFO L226 Difference]: Without dead ends: 893 [2019-09-20 13:28:31,044 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,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-09-20 13:28:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 691. [2019-09-20 13:28:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-09-20 13:28:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2019-09-20 13:28:31,054 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 130 [2019-09-20 13:28:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,055 INFO L475 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2019-09-20 13:28:31,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2019-09-20 13:28:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-20 13:28:31,056 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,057 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, 1] [2019-09-20 13:28:31,058 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash 428482225, now seen corresponding path program 1 times [2019-09-20 13:28:31,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:28:31,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:31,153 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:31,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:31,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:31,154 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2019-09-20 13:28:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,464 INFO L93 Difference]: Finished difference Result 723 states and 1088 transitions. [2019-09-20 13:28:31,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:31,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-20 13:28:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,468 INFO L225 Difference]: With dead ends: 723 [2019-09-20 13:28:31,468 INFO L226 Difference]: Without dead ends: 723 [2019-09-20 13:28:31,469 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:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-09-20 13:28:31,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 697. [2019-09-20 13:28:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-20 13:28:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1052 transitions. [2019-09-20 13:28:31,477 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1052 transitions. Word has length 131 [2019-09-20 13:28:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,478 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1052 transitions. [2019-09-20 13:28:31,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1052 transitions. [2019-09-20 13:28:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-20 13:28:31,479 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,479 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:31,479 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1591466697, now seen corresponding path program 1 times [2019-09-20 13:28:31,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-20 13:28:31,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:31,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:31,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:31,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:31,541 INFO L87 Difference]: Start difference. First operand 697 states and 1052 transitions. Second operand 4 states. [2019-09-20 13:28:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,811 INFO L93 Difference]: Finished difference Result 731 states and 1096 transitions. [2019-09-20 13:28:31,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:31,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-20 13:28:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,816 INFO L225 Difference]: With dead ends: 731 [2019-09-20 13:28:31,816 INFO L226 Difference]: Without dead ends: 731 [2019-09-20 13:28:31,816 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,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-20 13:28:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 697. [2019-09-20 13:28:31,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-09-20 13:28:31,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1050 transitions. [2019-09-20 13:28:31,825 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1050 transitions. Word has length 137 [2019-09-20 13:28:31,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,825 INFO L475 AbstractCegarLoop]: Abstraction has 697 states and 1050 transitions. [2019-09-20 13:28:31,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1050 transitions. [2019-09-20 13:28:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-20 13:28:31,826 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,827 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1339157233, now seen corresponding path program 1 times [2019-09-20 13:28:31,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-20 13:28:31,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:31,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:31,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:31,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:31,922 INFO L87 Difference]: Start difference. First operand 697 states and 1050 transitions. Second operand 4 states.