java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:59,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:59,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:59,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:59,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:59,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:59,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:59,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:59,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:59,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:59,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:59,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:59,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:59,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:59,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:59,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:59,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:59,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:59,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:59,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:59,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:59,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:59,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:59,737 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:59,739 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:59,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:59,740 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:59,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:59,741 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:59,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:59,742 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:59,743 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:59,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:59,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:59,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:59,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:59,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:59,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:59,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:59,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:59,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:59,749 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,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:59,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:59,764 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:59,764 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:59,765 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:59,765 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:59,765 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:59,765 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:59,766 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:59,766 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:59,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:59,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:59,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:59,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:59,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:59,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:59,768 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:59,768 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:59,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:59,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:59,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:59,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:59,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:59,770 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:59,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:59,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:59,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:59,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:59,819 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:59,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.15.i.cil-1.c [2019-09-20 13:27:59,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4013c23/40a2531b7be0442f87349d14eec76391/FLAG9def47285 [2019-09-20 13:28:00,485 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:28:00,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.15.i.cil-1.c [2019-09-20 13:28:00,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4013c23/40a2531b7be0442f87349d14eec76391/FLAG9def47285 [2019-09-20 13:28:00,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd4013c23/40a2531b7be0442f87349d14eec76391 [2019-09-20 13:28:00,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:28:00,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:28:00,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:00,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:28:00,724 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:28:00,725 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,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143585a2 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,728 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,736 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:28:00,818 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:28:01,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:01,497 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:28:01,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:28:01,727 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:28:01,727 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,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:28:01,729 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:28:01,729 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:28:01,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:28:01,744 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,746 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,797 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,797 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,859 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,870 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,874 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,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:28:01,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:28:01,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:28:01,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:28:01,883 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,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:28:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:28:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:28:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:28:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:28:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:28:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:28:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:28:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:28:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:28:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:28:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:28:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:28:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:28:01,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:28:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:28:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:28:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:28:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:28:01,961 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:28:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:28:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:28:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:28:01,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:28:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:28:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:28:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:28:01,963 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:28:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:28:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:28:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:28:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:28:01,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:28:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:28:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:28:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:28:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:28:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:28:01,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:28:02,451 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:28:03,237 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:28:03,237 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:28:03,259 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:28:03,259 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:28:03,260 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,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:28:03,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:28:03,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:28:03,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:28:03,266 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,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772fec20 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,267 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,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772fec20 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,267 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,269 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-09-20 13:28:03,279 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:28:03,287 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:28:03,304 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:28:03,330 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:28:03,331 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:28:03,331 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:28:03,331 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:28:03,331 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:28:03,331 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:28:03,331 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:28:03,331 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:28:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2019-09-20 13:28:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:28:03,364 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:03,365 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:03,367 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:03,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1890042678, now seen corresponding path program 1 times [2019-09-20 13:28:03,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:03,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:03,764 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,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:03,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:03,767 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:03,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:03,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:03,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:03,791 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2019-09-20 13:28:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,203 INFO L93 Difference]: Finished difference Result 193 states and 316 transitions. [2019-09-20 13:28:04,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-20 13:28:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,228 INFO L225 Difference]: With dead ends: 193 [2019-09-20 13:28:04,229 INFO L226 Difference]: Without dead ends: 172 [2019-09-20 13:28:04,233 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,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-20 13:28:04,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-09-20 13:28:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-20 13:28:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2019-09-20 13:28:04,288 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 49 [2019-09-20 13:28:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,288 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2019-09-20 13:28:04,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2019-09-20 13:28:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:28:04,292 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,292 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,293 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1217836546, now seen corresponding path program 1 times [2019-09-20 13:28:04,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,504 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,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:04,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:04,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:04,512 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand 4 states. [2019-09-20 13:28:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:04,870 INFO L93 Difference]: Finished difference Result 172 states and 258 transitions. [2019-09-20 13:28:04,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:04,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:28:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:04,873 INFO L225 Difference]: With dead ends: 172 [2019-09-20 13:28:04,873 INFO L226 Difference]: Without dead ends: 172 [2019-09-20 13:28:04,874 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-20 13:28:04,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2019-09-20 13:28:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-20 13:28:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 237 transitions. [2019-09-20 13:28:04,886 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 237 transitions. Word has length 62 [2019-09-20 13:28:04,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:04,886 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 237 transitions. [2019-09-20 13:28:04,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2019-09-20 13:28:04,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:04,889 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:04,889 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:04,890 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:04,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:04,890 INFO L82 PathProgramCache]: Analyzing trace with hash -947267054, now seen corresponding path program 1 times [2019-09-20 13:28:04,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:04,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:04,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:04,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:04,999 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:04,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:04,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:05,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:05,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:05,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:05,001 INFO L87 Difference]: Start difference. First operand 155 states and 237 transitions. Second operand 4 states. [2019-09-20 13:28:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,298 INFO L93 Difference]: Finished difference Result 171 states and 256 transitions. [2019-09-20 13:28:05,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:05,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:05,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,301 INFO L225 Difference]: With dead ends: 171 [2019-09-20 13:28:05,301 INFO L226 Difference]: Without dead ends: 171 [2019-09-20 13:28:05,302 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,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-20 13:28:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2019-09-20 13:28:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-20 13:28:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 236 transitions. [2019-09-20 13:28:05,311 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 236 transitions. Word has length 63 [2019-09-20 13:28:05,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,312 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 236 transitions. [2019-09-20 13:28:05,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 236 transitions. [2019-09-20 13:28:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:05,314 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,315 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:05,315 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash 939636390, now seen corresponding path program 1 times [2019-09-20 13:28:05,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:05,448 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,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:05,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:28:05,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:05,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:28:05,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:28:05,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:05,450 INFO L87 Difference]: Start difference. First operand 155 states and 236 transitions. Second operand 5 states. [2019-09-20 13:28:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:05,975 INFO L93 Difference]: Finished difference Result 176 states and 264 transitions. [2019-09-20 13:28:05,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:28:05,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-20 13:28:05,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:05,977 INFO L225 Difference]: With dead ends: 176 [2019-09-20 13:28:05,977 INFO L226 Difference]: Without dead ends: 176 [2019-09-20 13:28:05,977 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:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-09-20 13:28:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-09-20 13:28:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 263 transitions. [2019-09-20 13:28:05,986 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 263 transitions. Word has length 63 [2019-09-20 13:28:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:05,986 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 263 transitions. [2019-09-20 13:28:05,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:28:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 263 transitions. [2019-09-20 13:28:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:05,991 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:05,991 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:05,991 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2122203230, now seen corresponding path program 1 times [2019-09-20 13:28:05,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:05,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:05,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:05,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,108 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,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,108 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,111 INFO L87 Difference]: Start difference. First operand 175 states and 263 transitions. Second operand 4 states. [2019-09-20 13:28:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,374 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2019-09-20 13:28:06,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:06,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,376 INFO L225 Difference]: With dead ends: 190 [2019-09-20 13:28:06,376 INFO L226 Difference]: Without dead ends: 190 [2019-09-20 13:28:06,377 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,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-09-20 13:28:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 175. [2019-09-20 13:28:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 262 transitions. [2019-09-20 13:28:06,384 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 262 transitions. Word has length 63 [2019-09-20 13:28:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,385 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 262 transitions. [2019-09-20 13:28:06,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 262 transitions. [2019-09-20 13:28:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:28:06,386 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,387 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:06,387 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash 2054643229, now seen corresponding path program 1 times [2019-09-20 13:28:06,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,454 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,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,455 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,457 INFO L87 Difference]: Start difference. First operand 175 states and 262 transitions. Second operand 4 states. [2019-09-20 13:28:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:06,848 INFO L93 Difference]: Finished difference Result 188 states and 277 transitions. [2019-09-20 13:28:06,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:06,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:28:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:06,850 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:28:06,850 INFO L226 Difference]: Without dead ends: 188 [2019-09-20 13:28:06,850 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,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-20 13:28:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-20 13:28:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2019-09-20 13:28:06,857 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 63 [2019-09-20 13:28:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:06,857 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2019-09-20 13:28:06,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2019-09-20 13:28:06,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:28:06,859 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:06,859 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:06,859 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:06,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:06,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1184518913, now seen corresponding path program 1 times [2019-09-20 13:28:06,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:06,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:06,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:06,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:06,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:28:06,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:06,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:06,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:06,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:06,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:06,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:06,929 INFO L87 Difference]: Start difference. First operand 175 states and 261 transitions. Second operand 4 states. [2019-09-20 13:28:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,184 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-09-20 13:28:07,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:28:07,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,186 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:28:07,187 INFO L226 Difference]: Without dead ends: 188 [2019-09-20 13:28:07,187 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,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-20 13:28:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-20 13:28:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 260 transitions. [2019-09-20 13:28:07,193 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 260 transitions. Word has length 64 [2019-09-20 13:28:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,193 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 260 transitions. [2019-09-20 13:28:07,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 260 transitions. [2019-09-20 13:28:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:28:07,194 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,195 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,195 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash 927095706, now seen corresponding path program 1 times [2019-09-20 13:28:07,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,251 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,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,253 INFO L87 Difference]: Start difference. First operand 175 states and 260 transitions. Second operand 4 states. [2019-09-20 13:28:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,509 INFO L93 Difference]: Finished difference Result 188 states and 275 transitions. [2019-09-20 13:28:07,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:28:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,512 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:28:07,512 INFO L226 Difference]: Without dead ends: 188 [2019-09-20 13:28:07,513 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,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-20 13:28:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-20 13:28:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 259 transitions. [2019-09-20 13:28:07,519 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 259 transitions. Word has length 65 [2019-09-20 13:28:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,519 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 259 transitions. [2019-09-20 13:28:07,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 259 transitions. [2019-09-20 13:28:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:07,520 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,520 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,521 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1779390022, now seen corresponding path program 1 times [2019-09-20 13:28:07,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,579 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:07,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,580 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,581 INFO L87 Difference]: Start difference. First operand 175 states and 259 transitions. Second operand 4 states. [2019-09-20 13:28:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:07,823 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2019-09-20 13:28:07,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:07,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:07,825 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:28:07,825 INFO L226 Difference]: Without dead ends: 188 [2019-09-20 13:28:07,826 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,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-20 13:28:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2019-09-20 13:28:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-20 13:28:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2019-09-20 13:28:07,832 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 66 [2019-09-20 13:28:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:07,832 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2019-09-20 13:28:07,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2019-09-20 13:28:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:28:07,833 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:07,833 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:07,834 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:07,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1997488103, now seen corresponding path program 1 times [2019-09-20 13:28:07,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:07,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:07,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:07,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:07,896 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:07,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:07,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:07,896 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:07,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:07,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:07,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:07,897 INFO L87 Difference]: Start difference. First operand 175 states and 258 transitions. Second operand 4 states. [2019-09-20 13:28:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,192 INFO L93 Difference]: Finished difference Result 217 states and 320 transitions. [2019-09-20 13:28:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:28:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,194 INFO L225 Difference]: With dead ends: 217 [2019-09-20 13:28:08,194 INFO L226 Difference]: Without dead ends: 217 [2019-09-20 13:28:08,195 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,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-20 13:28:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-09-20 13:28:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2019-09-20 13:28:08,201 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 66 [2019-09-20 13:28:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,201 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2019-09-20 13:28:08,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2019-09-20 13:28:08,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:28:08,202 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,202 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,203 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,203 INFO L82 PathProgramCache]: Analyzing trace with hash 771836149, now seen corresponding path program 1 times [2019-09-20 13:28:08,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,264 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,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,266 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand 4 states. [2019-09-20 13:28:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,547 INFO L93 Difference]: Finished difference Result 200 states and 298 transitions. [2019-09-20 13:28:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:28:08,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,550 INFO L225 Difference]: With dead ends: 200 [2019-09-20 13:28:08,550 INFO L226 Difference]: Without dead ends: 200 [2019-09-20 13:28:08,550 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,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-09-20 13:28:08,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-09-20 13:28:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 294 transitions. [2019-09-20 13:28:08,556 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 294 transitions. Word has length 67 [2019-09-20 13:28:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,556 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 294 transitions. [2019-09-20 13:28:08,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 294 transitions. [2019-09-20 13:28:08,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:28:08,557 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,557 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,557 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,558 INFO L82 PathProgramCache]: Analyzing trace with hash -677623021, now seen corresponding path program 1 times [2019-09-20 13:28:08,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,614 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:08,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,616 INFO L87 Difference]: Start difference. First operand 197 states and 294 transitions. Second operand 4 states. [2019-09-20 13:28:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:08,891 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2019-09-20 13:28:08,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:08,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:28:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:08,893 INFO L225 Difference]: With dead ends: 217 [2019-09-20 13:28:08,893 INFO L226 Difference]: Without dead ends: 217 [2019-09-20 13:28:08,894 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,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-20 13:28:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 197. [2019-09-20 13:28:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2019-09-20 13:28:08,899 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 79 [2019-09-20 13:28:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:08,899 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2019-09-20 13:28:08,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2019-09-20 13:28:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:08,901 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:08,901 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:08,901 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash -802468499, now seen corresponding path program 1 times [2019-09-20 13:28:08,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:08,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:08,952 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:08,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:08,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:08,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:08,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:08,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:08,953 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand 4 states. [2019-09-20 13:28:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,234 INFO L93 Difference]: Finished difference Result 216 states and 316 transitions. [2019-09-20 13:28:09,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:09,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,235 INFO L225 Difference]: With dead ends: 216 [2019-09-20 13:28:09,235 INFO L226 Difference]: Without dead ends: 216 [2019-09-20 13:28:09,236 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,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-20 13:28:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 197. [2019-09-20 13:28:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 292 transitions. [2019-09-20 13:28:09,243 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 292 transitions. Word has length 80 [2019-09-20 13:28:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,244 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 292 transitions. [2019-09-20 13:28:09,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 292 transitions. [2019-09-20 13:28:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:28:09,245 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,245 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,245 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash -870028500, now seen corresponding path program 1 times [2019-09-20 13:28:09,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,312 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,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,314 INFO L87 Difference]: Start difference. First operand 197 states and 292 transitions. Second operand 4 states. [2019-09-20 13:28:09,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:09,643 INFO L93 Difference]: Finished difference Result 214 states and 313 transitions. [2019-09-20 13:28:09,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:09,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:28:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:09,646 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:09,646 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:09,647 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,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-20 13:28:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 291 transitions. [2019-09-20 13:28:09,656 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 291 transitions. Word has length 80 [2019-09-20 13:28:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:09,679 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 291 transitions. [2019-09-20 13:28:09,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 291 transitions. [2019-09-20 13:28:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:28:09,681 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:09,681 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:09,682 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:09,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:09,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1655029296, now seen corresponding path program 1 times [2019-09-20 13:28:09,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:09,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:09,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:09,767 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:09,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:09,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:09,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:09,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:09,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:09,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:09,769 INFO L87 Difference]: Start difference. First operand 197 states and 291 transitions. Second operand 4 states. [2019-09-20 13:28:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,061 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-20 13:28:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:28:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,063 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:10,063 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:10,064 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,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:10,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-20 13:28:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 290 transitions. [2019-09-20 13:28:10,069 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 290 transitions. Word has length 81 [2019-09-20 13:28:10,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,070 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 290 transitions. [2019-09-20 13:28:10,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 290 transitions. [2019-09-20 13:28:10,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:28:10,071 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,071 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,071 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,072 INFO L82 PathProgramCache]: Analyzing trace with hash -773824279, now seen corresponding path program 1 times [2019-09-20 13:28:10,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,136 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,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,140 INFO L87 Difference]: Start difference. First operand 197 states and 290 transitions. Second operand 4 states. [2019-09-20 13:28:10,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,402 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2019-09-20 13:28:10,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:28:10,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,404 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:10,404 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:10,405 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,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-20 13:28:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2019-09-20 13:28:10,410 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 82 [2019-09-20 13:28:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,410 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2019-09-20 13:28:10,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2019-09-20 13:28:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:28:10,411 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,412 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,412 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1326665291, now seen corresponding path program 1 times [2019-09-20 13:28:10,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,468 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:10,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,470 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand 4 states. [2019-09-20 13:28:10,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:10,807 INFO L93 Difference]: Finished difference Result 214 states and 310 transitions. [2019-09-20 13:28:10,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:10,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:28:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:10,810 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:28:10,810 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:28:10,811 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,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:28:10,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 197. [2019-09-20 13:28:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 288 transitions. [2019-09-20 13:28:10,819 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 288 transitions. Word has length 83 [2019-09-20 13:28:10,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:10,819 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 288 transitions. [2019-09-20 13:28:10,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:10,820 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2019-09-20 13:28:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:28:10,821 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:10,822 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:10,822 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:10,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1724696956, now seen corresponding path program 1 times [2019-09-20 13:28:10,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:10,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:10,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:10,916 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:10,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:10,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:10,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:10,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:10,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:10,919 INFO L87 Difference]: Start difference. First operand 197 states and 288 transitions. Second operand 4 states. [2019-09-20 13:28:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,272 INFO L93 Difference]: Finished difference Result 204 states and 297 transitions. [2019-09-20 13:28:11,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:28:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,275 INFO L225 Difference]: With dead ends: 204 [2019-09-20 13:28:11,275 INFO L226 Difference]: Without dead ends: 204 [2019-09-20 13:28:11,276 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,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-20 13:28:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2019-09-20 13:28:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-09-20 13:28:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 287 transitions. [2019-09-20 13:28:11,289 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 287 transitions. Word has length 84 [2019-09-20 13:28:11,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,290 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 287 transitions. [2019-09-20 13:28:11,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,290 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 287 transitions. [2019-09-20 13:28:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:28:11,292 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,293 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:11,293 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash 254389468, now seen corresponding path program 1 times [2019-09-20 13:28:11,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,413 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:11,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,417 INFO L87 Difference]: Start difference. First operand 197 states and 287 transitions. Second operand 4 states. [2019-09-20 13:28:11,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:11,826 INFO L93 Difference]: Finished difference Result 305 states and 452 transitions. [2019-09-20 13:28:11,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:11,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:28:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:11,829 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:28:11,829 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:28:11,830 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:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:28:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 238. [2019-09-20 13:28:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-20 13:28:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 360 transitions. [2019-09-20 13:28:11,836 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 360 transitions. Word has length 88 [2019-09-20 13:28:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:11,837 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 360 transitions. [2019-09-20 13:28:11,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 360 transitions. [2019-09-20 13:28:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:28:11,838 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:11,838 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:11,838 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:11,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:11,839 INFO L82 PathProgramCache]: Analyzing trace with hash 678036190, now seen corresponding path program 1 times [2019-09-20 13:28:11,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:11,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:11,905 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:11,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:11,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:11,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:11,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:11,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:11,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:11,906 INFO L87 Difference]: Start difference. First operand 238 states and 360 transitions. Second operand 4 states. [2019-09-20 13:28:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,231 INFO L93 Difference]: Finished difference Result 286 states and 431 transitions. [2019-09-20 13:28:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:28:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,235 INFO L225 Difference]: With dead ends: 286 [2019-09-20 13:28:12,235 INFO L226 Difference]: Without dead ends: 286 [2019-09-20 13:28:12,235 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,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-20 13:28:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 262. [2019-09-20 13:28:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-20 13:28:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 401 transitions. [2019-09-20 13:28:12,246 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 401 transitions. Word has length 88 [2019-09-20 13:28:12,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,246 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 401 transitions. [2019-09-20 13:28:12,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 401 transitions. [2019-09-20 13:28:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:28:12,249 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,249 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:12,249 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1640143096, now seen corresponding path program 1 times [2019-09-20 13:28:12,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:12,383 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,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:12,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:12,384 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:12,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:12,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:12,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:12,387 INFO L87 Difference]: Start difference. First operand 262 states and 401 transitions. Second operand 4 states. [2019-09-20 13:28:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:12,940 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2019-09-20 13:28:12,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:12,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:28:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:12,944 INFO L225 Difference]: With dead ends: 321 [2019-09-20 13:28:12,944 INFO L226 Difference]: Without dead ends: 321 [2019-09-20 13:28:12,944 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,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-20 13:28:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2019-09-20 13:28:12,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 402 transitions. [2019-09-20 13:28:12,955 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 402 transitions. Word has length 89 [2019-09-20 13:28:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:12,955 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 402 transitions. [2019-09-20 13:28:12,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 402 transitions. [2019-09-20 13:28:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:12,958 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:12,958 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:12,959 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:12,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1372359888, now seen corresponding path program 1 times [2019-09-20 13:28:12,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:12,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:12,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,103 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,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,104 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,105 INFO L87 Difference]: Start difference. First operand 263 states and 402 transitions. Second operand 4 states. [2019-09-20 13:28:13,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:13,633 INFO L93 Difference]: Finished difference Result 321 states and 480 transitions. [2019-09-20 13:28:13,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:13,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:13,637 INFO L225 Difference]: With dead ends: 321 [2019-09-20 13:28:13,637 INFO L226 Difference]: Without dead ends: 321 [2019-09-20 13:28:13,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:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-20 13:28:13,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 263. [2019-09-20 13:28:13,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 401 transitions. [2019-09-20 13:28:13,647 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 401 transitions. Word has length 101 [2019-09-20 13:28:13,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:13,647 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 401 transitions. [2019-09-20 13:28:13,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 401 transitions. [2019-09-20 13:28:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:28:13,649 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:13,649 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:13,649 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash -496340882, now seen corresponding path program 1 times [2019-09-20 13:28:13,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:13,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:13,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:13,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:13,739 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,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:13,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:13,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:13,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:13,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:13,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:13,741 INFO L87 Difference]: Start difference. First operand 263 states and 401 transitions. Second operand 4 states. [2019-09-20 13:28:14,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,052 INFO L93 Difference]: Finished difference Result 287 states and 430 transitions. [2019-09-20 13:28:14,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:28:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,056 INFO L225 Difference]: With dead ends: 287 [2019-09-20 13:28:14,056 INFO L226 Difference]: Without dead ends: 287 [2019-09-20 13:28:14,056 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,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-20 13:28:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 263. [2019-09-20 13:28:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 400 transitions. [2019-09-20 13:28:14,066 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 400 transitions. Word has length 101 [2019-09-20 13:28:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,067 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 400 transitions. [2019-09-20 13:28:14,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,067 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 400 transitions. [2019-09-20 13:28:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:14,069 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,069 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,070 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,070 INFO L82 PathProgramCache]: Analyzing trace with hash -864474896, now seen corresponding path program 1 times [2019-09-20 13:28:14,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,145 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,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,146 INFO L87 Difference]: Start difference. First operand 263 states and 400 transitions. Second operand 4 states. [2019-09-20 13:28:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:14,561 INFO L93 Difference]: Finished difference Result 320 states and 477 transitions. [2019-09-20 13:28:14,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:14,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:14,564 INFO L225 Difference]: With dead ends: 320 [2019-09-20 13:28:14,564 INFO L226 Difference]: Without dead ends: 320 [2019-09-20 13:28:14,564 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,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-09-20 13:28:14,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 263. [2019-09-20 13:28:14,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:14,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 399 transitions. [2019-09-20 13:28:14,571 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 399 transitions. Word has length 102 [2019-09-20 13:28:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:14,571 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 399 transitions. [2019-09-20 13:28:14,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 399 transitions. [2019-09-20 13:28:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:14,573 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:14,573 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:14,573 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:14,573 INFO L82 PathProgramCache]: Analyzing trace with hash -932034897, now seen corresponding path program 1 times [2019-09-20 13:28:14,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:14,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:14,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:14,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:14,639 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:14,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:14,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:14,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:14,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:14,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:14,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:14,641 INFO L87 Difference]: Start difference. First operand 263 states and 399 transitions. Second operand 4 states. [2019-09-20 13:28:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,122 INFO L93 Difference]: Finished difference Result 318 states and 474 transitions. [2019-09-20 13:28:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,125 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:15,125 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:15,125 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,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:15,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-20 13:28:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 398 transitions. [2019-09-20 13:28:15,134 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 398 transitions. Word has length 102 [2019-09-20 13:28:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,135 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 398 transitions. [2019-09-20 13:28:15,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 398 transitions. [2019-09-20 13:28:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:15,137 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,137 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:15,138 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,138 INFO L82 PathProgramCache]: Analyzing trace with hash 522310514, now seen corresponding path program 1 times [2019-09-20 13:28:15,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,217 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,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,219 INFO L87 Difference]: Start difference. First operand 263 states and 398 transitions. Second operand 4 states. [2019-09-20 13:28:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,510 INFO L93 Difference]: Finished difference Result 286 states and 426 transitions. [2019-09-20 13:28:15,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,513 INFO L225 Difference]: With dead ends: 286 [2019-09-20 13:28:15,513 INFO L226 Difference]: Without dead ends: 286 [2019-09-20 13:28:15,513 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,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-20 13:28:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 263. [2019-09-20 13:28:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2019-09-20 13:28:15,520 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 102 [2019-09-20 13:28:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,520 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2019-09-20 13:28:15,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2019-09-20 13:28:15,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:28:15,522 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,522 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:15,522 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,522 INFO L82 PathProgramCache]: Analyzing trace with hash 454750513, now seen corresponding path program 1 times [2019-09-20 13:28:15,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,584 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,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,586 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand 4 states. [2019-09-20 13:28:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:15,883 INFO L93 Difference]: Finished difference Result 284 states and 423 transitions. [2019-09-20 13:28:15,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:15,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:28:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:15,885 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:28:15,885 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:28:15,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:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:28:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-20 13:28:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 396 transitions. [2019-09-20 13:28:15,893 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 396 transitions. Word has length 102 [2019-09-20 13:28:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:15,893 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 396 transitions. [2019-09-20 13:28:15,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 396 transitions. [2019-09-20 13:28:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:15,895 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:15,895 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:15,896 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash 717739693, now seen corresponding path program 1 times [2019-09-20 13:28:15,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:15,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:15,950 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:15,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:15,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:15,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:15,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:15,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:15,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:15,952 INFO L87 Difference]: Start difference. First operand 263 states and 396 transitions. Second operand 4 states. [2019-09-20 13:28:16,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,317 INFO L93 Difference]: Finished difference Result 318 states and 471 transitions. [2019-09-20 13:28:16,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:16,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,320 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:16,320 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:16,320 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,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-20 13:28:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 395 transitions. [2019-09-20 13:28:16,327 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 395 transitions. Word has length 103 [2019-09-20 13:28:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,327 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 395 transitions. [2019-09-20 13:28:16,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,328 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 395 transitions. [2019-09-20 13:28:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:28:16,329 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,329 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,330 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash 758414443, now seen corresponding path program 1 times [2019-09-20 13:28:16,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,414 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,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,416 INFO L87 Difference]: Start difference. First operand 263 states and 395 transitions. Second operand 4 states. [2019-09-20 13:28:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:16,728 INFO L93 Difference]: Finished difference Result 284 states and 421 transitions. [2019-09-20 13:28:16,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:16,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:28:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:16,731 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:28:16,732 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:28:16,734 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,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:28:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-20 13:28:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:16,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 394 transitions. [2019-09-20 13:28:16,746 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 394 transitions. Word has length 103 [2019-09-20 13:28:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:16,747 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 394 transitions. [2019-09-20 13:28:16,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 394 transitions. [2019-09-20 13:28:16,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:16,749 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:16,750 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:16,750 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:16,751 INFO L82 PathProgramCache]: Analyzing trace with hash -232429652, now seen corresponding path program 1 times [2019-09-20 13:28:16,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:16,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:16,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:16,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:16,841 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:16,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:16,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:16,841 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:16,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:16,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:16,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:16,842 INFO L87 Difference]: Start difference. First operand 263 states and 394 transitions. Second operand 4 states. [2019-09-20 13:28:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,365 INFO L93 Difference]: Finished difference Result 318 states and 469 transitions. [2019-09-20 13:28:17,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,368 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:17,368 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:17,369 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,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-20 13:28:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:17,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 393 transitions. [2019-09-20 13:28:17,379 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 393 transitions. Word has length 104 [2019-09-20 13:28:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,379 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 393 transitions. [2019-09-20 13:28:17,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 393 transitions. [2019-09-20 13:28:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:28:17,382 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,382 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,382 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1028487598, now seen corresponding path program 1 times [2019-09-20 13:28:17,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:17,477 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,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:17,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:17,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:17,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:17,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:17,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:17,479 INFO L87 Difference]: Start difference. First operand 263 states and 393 transitions. Second operand 4 states. [2019-09-20 13:28:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:17,873 INFO L93 Difference]: Finished difference Result 284 states and 419 transitions. [2019-09-20 13:28:17,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:17,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:28:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:17,877 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:28:17,877 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:28:17,877 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,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:28:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-20 13:28:17,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 392 transitions. [2019-09-20 13:28:17,886 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 392 transitions. Word has length 104 [2019-09-20 13:28:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:17,887 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 392 transitions. [2019-09-20 13:28:17,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 392 transitions. [2019-09-20 13:28:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:17,889 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:17,890 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:17,890 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:17,891 INFO L82 PathProgramCache]: Analyzing trace with hash 930029544, now seen corresponding path program 1 times [2019-09-20 13:28:17,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:17,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:17,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:17,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,010 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,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,013 INFO L87 Difference]: Start difference. First operand 263 states and 392 transitions. Second operand 4 states. [2019-09-20 13:28:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:18,518 INFO L93 Difference]: Finished difference Result 318 states and 467 transitions. [2019-09-20 13:28:18,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:18,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:18,520 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:28:18,520 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:28:18,521 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:28:18,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 263. [2019-09-20 13:28:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 391 transitions. [2019-09-20 13:28:18,532 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 391 transitions. Word has length 105 [2019-09-20 13:28:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:18,533 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 391 transitions. [2019-09-20 13:28:18,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 391 transitions. [2019-09-20 13:28:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:28:18,536 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:18,536 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:18,537 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:18,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:18,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1363758630, now seen corresponding path program 1 times [2019-09-20 13:28:18,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:18,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:18,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:18,715 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,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:18,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:18,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:18,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:18,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:18,716 INFO L87 Difference]: Start difference. First operand 263 states and 391 transitions. Second operand 4 states. [2019-09-20 13:28:19,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,099 INFO L93 Difference]: Finished difference Result 284 states and 417 transitions. [2019-09-20 13:28:19,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:28:19,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,101 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:28:19,101 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:28:19,102 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:28:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:28:19,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 263. [2019-09-20 13:28:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 390 transitions. [2019-09-20 13:28:19,112 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 390 transitions. Word has length 105 [2019-09-20 13:28:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,112 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 390 transitions. [2019-09-20 13:28:19,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 390 transitions. [2019-09-20 13:28:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:19,114 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,114 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,114 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1135503225, now seen corresponding path program 1 times [2019-09-20 13:28:19,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,180 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,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,182 INFO L87 Difference]: Start difference. First operand 263 states and 390 transitions. Second operand 4 states. [2019-09-20 13:28:19,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,563 INFO L93 Difference]: Finished difference Result 308 states and 453 transitions. [2019-09-20 13:28:19,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:19,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,565 INFO L225 Difference]: With dead ends: 308 [2019-09-20 13:28:19,565 INFO L226 Difference]: Without dead ends: 308 [2019-09-20 13:28:19,566 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,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-20 13:28:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2019-09-20 13:28:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2019-09-20 13:28:19,572 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 106 [2019-09-20 13:28:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,572 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2019-09-20 13:28:19,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2019-09-20 13:28:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:28:19,573 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,574 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,574 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash -574803447, now seen corresponding path program 1 times [2019-09-20 13:28:19,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,635 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,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,637 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand 4 states. [2019-09-20 13:28:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:19,901 INFO L93 Difference]: Finished difference Result 274 states and 403 transitions. [2019-09-20 13:28:19,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:19,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:28:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:19,904 INFO L225 Difference]: With dead ends: 274 [2019-09-20 13:28:19,904 INFO L226 Difference]: Without dead ends: 274 [2019-09-20 13:28:19,904 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,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-20 13:28:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2019-09-20 13:28:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 388 transitions. [2019-09-20 13:28:19,910 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 388 transitions. Word has length 106 [2019-09-20 13:28:19,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:19,910 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 388 transitions. [2019-09-20 13:28:19,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 388 transitions. [2019-09-20 13:28:19,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:28:19,911 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:19,912 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:19,912 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:19,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:19,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1961804019, now seen corresponding path program 1 times [2019-09-20 13:28:19,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:19,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:19,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:19,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:19,979 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:19,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:19,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:19,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:19,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:19,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:19,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:19,981 INFO L87 Difference]: Start difference. First operand 263 states and 388 transitions. Second operand 4 states. [2019-09-20 13:28:20,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,354 INFO L93 Difference]: Finished difference Result 308 states and 451 transitions. [2019-09-20 13:28:20,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-20 13:28:20,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,357 INFO L225 Difference]: With dead ends: 308 [2019-09-20 13:28:20,358 INFO L226 Difference]: Without dead ends: 308 [2019-09-20 13:28:20,358 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,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-09-20 13:28:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 263. [2019-09-20 13:28:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-09-20 13:28:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 387 transitions. [2019-09-20 13:28:20,364 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 387 transitions. Word has length 110 [2019-09-20 13:28:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,364 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 387 transitions. [2019-09-20 13:28:20,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 387 transitions. [2019-09-20 13:28:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:28:20,366 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,366 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:28:20,366 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1544407413, now seen corresponding path program 1 times [2019-09-20 13:28:20,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,444 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,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,445 INFO L87 Difference]: Start difference. First operand 263 states and 387 transitions. Second operand 4 states. [2019-09-20 13:28:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:20,749 INFO L93 Difference]: Finished difference Result 315 states and 465 transitions. [2019-09-20 13:28:20,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:20,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-20 13:28:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:20,752 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:28:20,752 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:28:20,752 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:20,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:28:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-09-20 13:28:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 432 transitions. [2019-09-20 13:28:20,759 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 432 transitions. Word has length 110 [2019-09-20 13:28:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:20,759 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 432 transitions. [2019-09-20 13:28:20,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 432 transitions. [2019-09-20 13:28:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-20 13:28:20,761 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:20,761 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, 1] [2019-09-20 13:28:20,761 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash 193721619, now seen corresponding path program 1 times [2019-09-20 13:28:20,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:20,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:20,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:20,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:20,836 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:20,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:20,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:20,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:20,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:20,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:20,838 INFO L87 Difference]: Start difference. First operand 289 states and 432 transitions. Second operand 4 states. [2019-09-20 13:28:21,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,188 INFO L93 Difference]: Finished difference Result 334 states and 495 transitions. [2019-09-20 13:28:21,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-20 13:28:21,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,191 INFO L225 Difference]: With dead ends: 334 [2019-09-20 13:28:21,191 INFO L226 Difference]: Without dead ends: 334 [2019-09-20 13:28:21,192 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,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-09-20 13:28:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 289. [2019-09-20 13:28:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 431 transitions. [2019-09-20 13:28:21,199 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 431 transitions. Word has length 113 [2019-09-20 13:28:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,199 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 431 transitions. [2019-09-20 13:28:21,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 431 transitions. [2019-09-20 13:28:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-20 13:28:21,200 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,201 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, 1] [2019-09-20 13:28:21,201 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,201 INFO L82 PathProgramCache]: Analyzing trace with hash 938446418, now seen corresponding path program 1 times [2019-09-20 13:28:21,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,280 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,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,281 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,282 INFO L87 Difference]: Start difference. First operand 289 states and 431 transitions. Second operand 4 states. [2019-09-20 13:28:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:21,681 INFO L93 Difference]: Finished difference Result 326 states and 481 transitions. [2019-09-20 13:28:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:21,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-20 13:28:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:21,684 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:28:21,684 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:28:21,684 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,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:28:21,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2019-09-20 13:28:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 430 transitions. [2019-09-20 13:28:21,692 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 430 transitions. Word has length 114 [2019-09-20 13:28:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:21,693 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 430 transitions. [2019-09-20 13:28:21,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 430 transitions. [2019-09-20 13:28:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-20 13:28:21,694 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:21,694 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, 1] [2019-09-20 13:28:21,694 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:21,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:21,695 INFO L82 PathProgramCache]: Analyzing trace with hash -498124115, now seen corresponding path program 1 times [2019-09-20 13:28:21,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:21,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:21,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:21,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:21,770 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:21,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:21,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:21,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:21,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:21,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:21,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:21,772 INFO L87 Difference]: Start difference. First operand 289 states and 430 transitions. Second operand 4 states. [2019-09-20 13:28:22,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,316 INFO L93 Difference]: Finished difference Result 326 states and 480 transitions. [2019-09-20 13:28:22,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-20 13:28:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,319 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:28:22,319 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:28:22,320 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,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:28:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2019-09-20 13:28:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 429 transitions. [2019-09-20 13:28:22,329 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 429 transitions. Word has length 115 [2019-09-20 13:28:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,329 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 429 transitions. [2019-09-20 13:28:22,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 429 transitions. [2019-09-20 13:28:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:28:22,332 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,332 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, 1] [2019-09-20 13:28:22,332 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash -9995480, now seen corresponding path program 1 times [2019-09-20 13:28:22,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,438 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,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,441 INFO L87 Difference]: Start difference. First operand 289 states and 429 transitions. Second operand 4 states. [2019-09-20 13:28:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:22,828 INFO L93 Difference]: Finished difference Result 326 states and 479 transitions. [2019-09-20 13:28:22,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:22,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-20 13:28:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:22,831 INFO L225 Difference]: With dead ends: 326 [2019-09-20 13:28:22,831 INFO L226 Difference]: Without dead ends: 326 [2019-09-20 13:28:22,831 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,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-09-20 13:28:22,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 289. [2019-09-20 13:28:22,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 428 transitions. [2019-09-20 13:28:22,872 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 428 transitions. Word has length 116 [2019-09-20 13:28:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:22,873 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 428 transitions. [2019-09-20 13:28:22,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 428 transitions. [2019-09-20 13:28:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-20 13:28:22,874 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:22,874 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, 1] [2019-09-20 13:28:22,875 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:22,875 INFO L82 PathProgramCache]: Analyzing trace with hash 594719628, now seen corresponding path program 1 times [2019-09-20 13:28:22,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:22,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:22,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:22,951 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,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:22,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:22,951 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:22,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:22,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:22,952 INFO L87 Difference]: Start difference. First operand 289 states and 428 transitions. Second operand 4 states. [2019-09-20 13:28:23,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,261 INFO L93 Difference]: Finished difference Result 324 states and 476 transitions. [2019-09-20 13:28:23,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-20 13:28:23,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,263 INFO L225 Difference]: With dead ends: 324 [2019-09-20 13:28:23,263 INFO L226 Difference]: Without dead ends: 324 [2019-09-20 13:28:23,264 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,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-20 13:28:23,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 289. [2019-09-20 13:28:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 427 transitions. [2019-09-20 13:28:23,270 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 427 transitions. Word has length 116 [2019-09-20 13:28:23,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,270 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 427 transitions. [2019-09-20 13:28:23,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 427 transitions. [2019-09-20 13:28:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-20 13:28:23,271 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,272 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, 1] [2019-09-20 13:28:23,272 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,272 INFO L82 PathProgramCache]: Analyzing trace with hash -179022615, now seen corresponding path program 1 times [2019-09-20 13:28:23,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,347 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,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,349 INFO L87 Difference]: Start difference. First operand 289 states and 427 transitions. Second operand 4 states. [2019-09-20 13:28:23,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:23,667 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2019-09-20 13:28:23,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:23,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-20 13:28:23,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:23,670 INFO L225 Difference]: With dead ends: 322 [2019-09-20 13:28:23,670 INFO L226 Difference]: Without dead ends: 322 [2019-09-20 13:28:23,671 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,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-09-20 13:28:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 289. [2019-09-20 13:28:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 426 transitions. [2019-09-20 13:28:23,677 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 426 transitions. Word has length 117 [2019-09-20 13:28:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:23,677 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 426 transitions. [2019-09-20 13:28:23,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 426 transitions. [2019-09-20 13:28:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-20 13:28:23,678 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:23,679 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, 1] [2019-09-20 13:28:23,679 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:23,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1648380811, now seen corresponding path program 1 times [2019-09-20 13:28:23,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:23,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:23,755 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,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:23,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:23,756 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:23,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:23,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:23,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:23,757 INFO L87 Difference]: Start difference. First operand 289 states and 426 transitions. Second operand 4 states. [2019-09-20 13:28:24,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,047 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2019-09-20 13:28:24,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-20 13:28:24,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,050 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:24,050 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:24,050 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,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2019-09-20 13:28:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 425 transitions. [2019-09-20 13:28:24,056 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 425 transitions. Word has length 117 [2019-09-20 13:28:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,056 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 425 transitions. [2019-09-20 13:28:24,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,056 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 425 transitions. [2019-09-20 13:28:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-20 13:28:24,057 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,058 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,058 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,058 INFO L82 PathProgramCache]: Analyzing trace with hash -894819603, now seen corresponding path program 1 times [2019-09-20 13:28:24,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,127 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,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,129 INFO L87 Difference]: Start difference. First operand 289 states and 425 transitions. Second operand 4 states. [2019-09-20 13:28:24,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,428 INFO L93 Difference]: Finished difference Result 319 states and 466 transitions. [2019-09-20 13:28:24,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-09-20 13:28:24,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,430 INFO L225 Difference]: With dead ends: 319 [2019-09-20 13:28:24,430 INFO L226 Difference]: Without dead ends: 319 [2019-09-20 13:28:24,431 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,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-20 13:28:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 289. [2019-09-20 13:28:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:24,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 424 transitions. [2019-09-20 13:28:24,436 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 424 transitions. Word has length 119 [2019-09-20 13:28:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,437 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 424 transitions. [2019-09-20 13:28:24,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 424 transitions. [2019-09-20 13:28:24,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:28:24,438 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,438 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,438 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1214178959, now seen corresponding path program 1 times [2019-09-20 13:28:24,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,537 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,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,538 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,539 INFO L87 Difference]: Start difference. First operand 289 states and 424 transitions. Second operand 4 states. [2019-09-20 13:28:24,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:24,820 INFO L93 Difference]: Finished difference Result 315 states and 460 transitions. [2019-09-20 13:28:24,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:24,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-20 13:28:24,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:24,823 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:28:24,823 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:28:24,823 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,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:28:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-09-20 13:28:24,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 423 transitions. [2019-09-20 13:28:24,830 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 423 transitions. Word has length 120 [2019-09-20 13:28:24,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:24,830 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 423 transitions. [2019-09-20 13:28:24,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 423 transitions. [2019-09-20 13:28:24,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-20 13:28:24,831 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:24,832 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:24,832 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:24,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:24,832 INFO L82 PathProgramCache]: Analyzing trace with hash -568746750, now seen corresponding path program 1 times [2019-09-20 13:28:24,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:24,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:24,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:24,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:24,919 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:24,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:24,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:24,920 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:24,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:24,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:24,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:24,922 INFO L87 Difference]: Start difference. First operand 289 states and 423 transitions. Second operand 4 states. [2019-09-20 13:28:25,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,238 INFO L93 Difference]: Finished difference Result 315 states and 459 transitions. [2019-09-20 13:28:25,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-09-20 13:28:25,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,243 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:28:25,243 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:28:25,244 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,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:28:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 289. [2019-09-20 13:28:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 422 transitions. [2019-09-20 13:28:25,251 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 422 transitions. Word has length 120 [2019-09-20 13:28:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,251 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 422 transitions. [2019-09-20 13:28:25,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,252 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 422 transitions. [2019-09-20 13:28:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-20 13:28:25,254 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,254 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,254 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash 792898142, now seen corresponding path program 1 times [2019-09-20 13:28:25,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,341 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,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,343 INFO L87 Difference]: Start difference. First operand 289 states and 422 transitions. Second operand 4 states. [2019-09-20 13:28:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:25,644 INFO L93 Difference]: Finished difference Result 313 states and 456 transitions. [2019-09-20 13:28:25,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:25,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-09-20 13:28:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:25,647 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:28:25,647 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:28:25,647 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,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:28:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2019-09-20 13:28:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 421 transitions. [2019-09-20 13:28:25,655 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 421 transitions. Word has length 121 [2019-09-20 13:28:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:25,655 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 421 transitions. [2019-09-20 13:28:25,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 421 transitions. [2019-09-20 13:28:25,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:28:25,657 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:25,658 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,658 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:25,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:25,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1650988349, now seen corresponding path program 1 times [2019-09-20 13:28:25,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:25,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:25,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:25,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:25,731 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,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:25,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:25,731 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:25,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:25,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:25,734 INFO L87 Difference]: Start difference. First operand 289 states and 421 transitions. Second operand 4 states. [2019-09-20 13:28:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,046 INFO L93 Difference]: Finished difference Result 313 states and 455 transitions. [2019-09-20 13:28:26,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-09-20 13:28:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,049 INFO L225 Difference]: With dead ends: 313 [2019-09-20 13:28:26,049 INFO L226 Difference]: Without dead ends: 313 [2019-09-20 13:28:26,050 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,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-20 13:28:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2019-09-20 13:28:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 420 transitions. [2019-09-20 13:28:26,060 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 420 transitions. Word has length 122 [2019-09-20 13:28:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,061 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 420 transitions. [2019-09-20 13:28:26,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 420 transitions. [2019-09-20 13:28:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:26,062 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,062 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,062 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1396412679, now seen corresponding path program 1 times [2019-09-20 13:28:26,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,148 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,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,153 INFO L87 Difference]: Start difference. First operand 289 states and 420 transitions. Second operand 4 states. [2019-09-20 13:28:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,444 INFO L93 Difference]: Finished difference Result 311 states and 452 transitions. [2019-09-20 13:28:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,447 INFO L225 Difference]: With dead ends: 311 [2019-09-20 13:28:26,447 INFO L226 Difference]: Without dead ends: 311 [2019-09-20 13:28:26,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:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-20 13:28:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 289. [2019-09-20 13:28:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-09-20 13:28:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 419 transitions. [2019-09-20 13:28:26,457 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 419 transitions. Word has length 123 [2019-09-20 13:28:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,457 INFO L475 AbstractCegarLoop]: Abstraction has 289 states and 419 transitions. [2019-09-20 13:28:26,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 419 transitions. [2019-09-20 13:28:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-20 13:28:26,459 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,459 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, 1] [2019-09-20 13:28:26,460 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1284876489, now seen corresponding path program 1 times [2019-09-20 13:28:26,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:26,566 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,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:26,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:26,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:26,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:26,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:26,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:26,568 INFO L87 Difference]: Start difference. First operand 289 states and 419 transitions. Second operand 4 states. [2019-09-20 13:28:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:26,928 INFO L93 Difference]: Finished difference Result 360 states and 528 transitions. [2019-09-20 13:28:26,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:26,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-20 13:28:26,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:26,931 INFO L225 Difference]: With dead ends: 360 [2019-09-20 13:28:26,931 INFO L226 Difference]: Without dead ends: 360 [2019-09-20 13:28:26,931 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-09-20 13:28:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 321. [2019-09-20 13:28:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-09-20 13:28:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 476 transitions. [2019-09-20 13:28:26,936 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 476 transitions. Word has length 123 [2019-09-20 13:28:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:26,936 INFO L475 AbstractCegarLoop]: Abstraction has 321 states and 476 transitions. [2019-09-20 13:28:26,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 476 transitions. [2019-09-20 13:28:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-20 13:28:26,937 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:26,937 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:26,938 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:26,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1847510473, now seen corresponding path program 1 times [2019-09-20 13:28:26,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:26,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:26,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:26,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,024 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,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,026 INFO L87 Difference]: Start difference. First operand 321 states and 476 transitions. Second operand 4 states. [2019-09-20 13:28:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,474 INFO L93 Difference]: Finished difference Result 427 states and 639 transitions. [2019-09-20 13:28:27,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-09-20 13:28:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,478 INFO L225 Difference]: With dead ends: 427 [2019-09-20 13:28:27,478 INFO L226 Difference]: Without dead ends: 427 [2019-09-20 13:28:27,478 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,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-20 13:28:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 360. [2019-09-20 13:28:27,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:28:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 547 transitions. [2019-09-20 13:28:27,486 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 547 transitions. Word has length 124 [2019-09-20 13:28:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,487 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 547 transitions. [2019-09-20 13:28:27,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 547 transitions. [2019-09-20 13:28:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:28:27,489 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,489 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, 1] [2019-09-20 13:28:27,489 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1110059788, now seen corresponding path program 1 times [2019-09-20 13:28:27,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,547 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,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,548 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,549 INFO L87 Difference]: Start difference. First operand 360 states and 547 transitions. Second operand 4 states. [2019-09-20 13:28:27,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:27,845 INFO L93 Difference]: Finished difference Result 386 states and 579 transitions. [2019-09-20 13:28:27,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:27,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:28:27,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:27,848 INFO L225 Difference]: With dead ends: 386 [2019-09-20 13:28:27,849 INFO L226 Difference]: Without dead ends: 386 [2019-09-20 13:28:27,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:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-09-20 13:28:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 360. [2019-09-20 13:28:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:28:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 546 transitions. [2019-09-20 13:28:27,855 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 546 transitions. Word has length 125 [2019-09-20 13:28:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:27,856 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 546 transitions. [2019-09-20 13:28:27,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:27,856 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 546 transitions. [2019-09-20 13:28:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-20 13:28:27,857 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:27,858 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, 1] [2019-09-20 13:28:27,858 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash -512713301, now seen corresponding path program 1 times [2019-09-20 13:28:27,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:27,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:27,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:27,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:27,934 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,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:27,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:27,935 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:27,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:27,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:27,936 INFO L87 Difference]: Start difference. First operand 360 states and 546 transitions. Second operand 4 states. [2019-09-20 13:28:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,340 INFO L93 Difference]: Finished difference Result 419 states and 626 transitions. [2019-09-20 13:28:28,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-20 13:28:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,344 INFO L225 Difference]: With dead ends: 419 [2019-09-20 13:28:28,344 INFO L226 Difference]: Without dead ends: 419 [2019-09-20 13:28:28,344 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,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-20 13:28:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 359. [2019-09-20 13:28:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-20 13:28:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2019-09-20 13:28:28,350 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 125 [2019-09-20 13:28:28,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,351 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2019-09-20 13:28:28,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,351 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2019-09-20 13:28:28,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-20 13:28:28,352 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,353 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, 1] [2019-09-20 13:28:28,353 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1059638715, now seen corresponding path program 1 times [2019-09-20 13:28:28,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,415 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,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,416 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,417 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand 4 states. [2019-09-20 13:28:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:28,720 INFO L93 Difference]: Finished difference Result 385 states and 577 transitions. [2019-09-20 13:28:28,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:28,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-20 13:28:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:28,723 INFO L225 Difference]: With dead ends: 385 [2019-09-20 13:28:28,723 INFO L226 Difference]: Without dead ends: 385 [2019-09-20 13:28:28,723 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,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-20 13:28:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2019-09-20 13:28:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-20 13:28:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 544 transitions. [2019-09-20 13:28:28,729 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 544 transitions. Word has length 126 [2019-09-20 13:28:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:28,729 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 544 transitions. [2019-09-20 13:28:28,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 544 transitions. [2019-09-20 13:28:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:28:28,730 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:28,731 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, 1] [2019-09-20 13:28:28,731 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:28,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1056352367, now seen corresponding path program 1 times [2019-09-20 13:28:28,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:28,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:28,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:28,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:28,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:28,800 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:28,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:28,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:28,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:28,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:28,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:28,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:28,801 INFO L87 Difference]: Start difference. First operand 359 states and 544 transitions. Second operand 4 states. [2019-09-20 13:28:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,078 INFO L93 Difference]: Finished difference Result 385 states and 576 transitions. [2019-09-20 13:28:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-09-20 13:28:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,082 INFO L225 Difference]: With dead ends: 385 [2019-09-20 13:28:29,082 INFO L226 Difference]: Without dead ends: 385 [2019-09-20 13:28:29,083 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,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-09-20 13:28:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2019-09-20 13:28:29,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-20 13:28:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 543 transitions. [2019-09-20 13:28:29,089 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 543 transitions. Word has length 127 [2019-09-20 13:28:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,089 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 543 transitions. [2019-09-20 13:28:29,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 543 transitions. [2019-09-20 13:28:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-20 13:28:29,091 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,091 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, 1] [2019-09-20 13:28:29,091 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1514463008, now seen corresponding path program 1 times [2019-09-20 13:28:29,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,161 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,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,162 INFO L87 Difference]: Start difference. First operand 359 states and 543 transitions. Second operand 4 states. [2019-09-20 13:28:29,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,422 INFO L93 Difference]: Finished difference Result 375 states and 563 transitions. [2019-09-20 13:28:29,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-20 13:28:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,425 INFO L225 Difference]: With dead ends: 375 [2019-09-20 13:28:29,425 INFO L226 Difference]: Without dead ends: 375 [2019-09-20 13:28:29,426 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,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-20 13:28:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 359. [2019-09-20 13:28:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-20 13:28:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2019-09-20 13:28:29,431 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 128 [2019-09-20 13:28:29,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,432 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2019-09-20 13:28:29,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,432 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2019-09-20 13:28:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:28:29,433 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,433 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,434 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1739032258, now seen corresponding path program 1 times [2019-09-20 13:28:29,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:29,510 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:29,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:29,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:29,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:29,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:29,512 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2019-09-20 13:28:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:29,927 INFO L93 Difference]: Finished difference Result 465 states and 705 transitions. [2019-09-20 13:28:29,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:29,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-20 13:28:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:29,930 INFO L225 Difference]: With dead ends: 465 [2019-09-20 13:28:29,930 INFO L226 Difference]: Without dead ends: 465 [2019-09-20 13:28:29,931 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-20 13:28:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 398. [2019-09-20 13:28:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-20 13:28:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 613 transitions. [2019-09-20 13:28:29,937 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 613 transitions. Word has length 129 [2019-09-20 13:28:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:29,938 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 613 transitions. [2019-09-20 13:28:29,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 613 transitions. [2019-09-20 13:28:29,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-20 13:28:29,939 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:29,939 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:29,940 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:29,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:29,940 INFO L82 PathProgramCache]: Analyzing trace with hash -26388266, now seen corresponding path program 1 times [2019-09-20 13:28:29,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:29,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:29,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:29,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,015 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,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,016 INFO L87 Difference]: Start difference. First operand 398 states and 613 transitions. Second operand 4 states. [2019-09-20 13:28:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,430 INFO L93 Difference]: Finished difference Result 457 states and 693 transitions. [2019-09-20 13:28:30,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:30,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-20 13:28:30,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,432 INFO L225 Difference]: With dead ends: 457 [2019-09-20 13:28:30,432 INFO L226 Difference]: Without dead ends: 457 [2019-09-20 13:28:30,433 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,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2019-09-20 13:28:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 359. [2019-09-20 13:28:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-09-20 13:28:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 542 transitions. [2019-09-20 13:28:30,439 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 542 transitions. Word has length 130 [2019-09-20 13:28:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,439 INFO L475 AbstractCegarLoop]: Abstraction has 359 states and 542 transitions. [2019-09-20 13:28:30,439 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 542 transitions. [2019-09-20 13:28:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-20 13:28:30,440 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,441 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:30,441 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,441 INFO L82 PathProgramCache]: Analyzing trace with hash 889689834, now seen corresponding path program 1 times [2019-09-20 13:28:30,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,519 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:30,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,521 INFO L87 Difference]: Start difference. First operand 359 states and 542 transitions. Second operand 4 states. [2019-09-20 13:28:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:30,821 INFO L93 Difference]: Finished difference Result 374 states and 561 transitions. [2019-09-20 13:28:30,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:30,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-20 13:28:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:30,824 INFO L225 Difference]: With dead ends: 374 [2019-09-20 13:28:30,825 INFO L226 Difference]: Without dead ends: 374 [2019-09-20 13:28:30,825 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:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-20 13:28:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 362. [2019-09-20 13:28:30,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-20 13:28:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 545 transitions. [2019-09-20 13:28:30,831 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 545 transitions. Word has length 131 [2019-09-20 13:28:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:30,831 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 545 transitions. [2019-09-20 13:28:30,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 545 transitions. [2019-09-20 13:28:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-20 13:28:30,832 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:30,833 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, 1] [2019-09-20 13:28:30,833 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:30,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1967666446, now seen corresponding path program 1 times [2019-09-20 13:28:30,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:30,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:30,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:30,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:30,892 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:30,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:30,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:30,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:30,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:30,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:30,894 INFO L87 Difference]: Start difference. First operand 362 states and 545 transitions. Second operand 4 states. [2019-09-20 13:28:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:28:31,132 INFO L93 Difference]: Finished difference Result 378 states and 565 transitions. [2019-09-20 13:28:31,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:28:31,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-20 13:28:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:28:31,138 INFO L225 Difference]: With dead ends: 378 [2019-09-20 13:28:31,138 INFO L226 Difference]: Without dead ends: 378 [2019-09-20 13:28:31,139 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,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-20 13:28:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 362. [2019-09-20 13:28:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-20 13:28:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 544 transitions. [2019-09-20 13:28:31,145 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 544 transitions. Word has length 138 [2019-09-20 13:28:31,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:28:31,145 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 544 transitions. [2019-09-20 13:28:31,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:28:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 544 transitions. [2019-09-20 13:28:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-20 13:28:31,146 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:28:31,147 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, 1] [2019-09-20 13:28:31,147 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:28:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:28:31,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1007233089, now seen corresponding path program 1 times [2019-09-20 13:28:31,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:28:31,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:28:31,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:28:31,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:28:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:28:31,215 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,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:28:31,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:28:31,215 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:28:31,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:28:31,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:28:31,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:28:31,217 INFO L87 Difference]: Start difference. First operand 362 states and 544 transitions. Second operand 4 states.