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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:22:28,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:28,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:28,673 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:28,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:28,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:28,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:28,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:28,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:28,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:28,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:28,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:28,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:28,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:28,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:28,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:28,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:28,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:28,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:28,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:28,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:28,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:28,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:28,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:28,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:28,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:28,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:28,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:28,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:28,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:28,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:28,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:28,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:28,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:28,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:28,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:28,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:28,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:28,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:28,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:28,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:28,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:22:28,775 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:28,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:28,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:28,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:28,782 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:28,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:28,783 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:28,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:28,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:28,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:28,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:28,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:28,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:28,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:28,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:28,786 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:28,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:28,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:28,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:28,786 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:28,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:28,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:28,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:28,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:28,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:28,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:28,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:28,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:28,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:22:29,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:29,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:29,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:29,109 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:29,109 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:29,110 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-13 23:22:29,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddffcc98a/1eafd133f2b6420ea6091dba969f4da1/FLAG10c458b6b [2019-10-13 23:22:29,701 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:29,702 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-13 23:22:29,728 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddffcc98a/1eafd133f2b6420ea6091dba969f4da1/FLAG10c458b6b [2019-10-13 23:22:30,009 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddffcc98a/1eafd133f2b6420ea6091dba969f4da1 [2019-10-13 23:22:30,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:30,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:30,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:30,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:30,026 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:30,027 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137c7c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30, skipping insertion in model container [2019-10-13 23:22:30,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,039 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:30,087 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:30,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:30,572 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:30,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:30,682 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:30,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30 WrapperNode [2019-10-13 23:22:30,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:30,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:30,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:30,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:30,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,733 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,751 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:30,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:30,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:30,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:30,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (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-10-13 23:22:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-13 23:22:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-13 23:22:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-13 23:22:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-13 23:22:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-13 23:22:30,827 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-13 23:22:30,828 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-13 23:22:30,830 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-13 23:22:30,830 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 23:22:30,830 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-13 23:22:30,830 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-13 23:22:30,830 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-13 23:22:30,831 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-13 23:22:30,831 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-13 23:22:30,831 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 23:22:30,831 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:30,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 23:22:30,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:30,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:30,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:30,832 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:30,832 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:30,832 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-13 23:22:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-13 23:22:30,833 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-13 23:22:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-13 23:22:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-13 23:22:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-13 23:22:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-13 23:22:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-13 23:22:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:30,835 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-13 23:22:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-13 23:22:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-13 23:22:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-13 23:22:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-13 23:22:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:30,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:30,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:32,210 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:32,211 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 23:22:32,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:32 BoogieIcfgContainer [2019-10-13 23:22:32,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:32,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:32,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:32,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:32,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:30" (1/3) ... [2019-10-13 23:22:32,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdaf301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:32, skipping insertion in model container [2019-10-13 23:22:32,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (2/3) ... [2019-10-13 23:22:32,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdaf301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:32, skipping insertion in model container [2019-10-13 23:22:32,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:32" (3/3) ... [2019-10-13 23:22:32,225 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-13 23:22:32,235 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:32,245 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:22:32,256 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:22:32,303 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:32,304 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:32,304 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:32,304 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:32,304 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:32,304 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:32,304 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:32,305 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:32,344 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states. [2019-10-13 23:22:32,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:22:32,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:32,360 INFO L380 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] [2019-10-13 23:22:32,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:32,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1264389532, now seen corresponding path program 1 times [2019-10-13 23:22:32,385 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:32,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340886067] [2019-10-13 23:22:32,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:32,386 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:32,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:32,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340886067] [2019-10-13 23:22:32,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:32,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:32,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59516045] [2019-10-13 23:22:32,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:32,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:32,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:32,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:32,950 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 4 states. [2019-10-13 23:22:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:33,088 INFO L93 Difference]: Finished difference Result 365 states and 554 transitions. [2019-10-13 23:22:33,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:33,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-13 23:22:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:33,107 INFO L225 Difference]: With dead ends: 365 [2019-10-13 23:22:33,107 INFO L226 Difference]: Without dead ends: 186 [2019-10-13 23:22:33,115 INFO L600 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-10-13 23:22:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-10-13 23:22:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-10-13 23:22:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-13 23:22:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 264 transitions. [2019-10-13 23:22:33,190 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 264 transitions. Word has length 44 [2019-10-13 23:22:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:33,191 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 264 transitions. [2019-10-13 23:22:33,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 264 transitions. [2019-10-13 23:22:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-13 23:22:33,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:33,196 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:33,196 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:33,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:33,197 INFO L82 PathProgramCache]: Analyzing trace with hash 118430116, now seen corresponding path program 1 times [2019-10-13 23:22:33,197 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:33,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330767361] [2019-10-13 23:22:33,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:33,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330767361] [2019-10-13 23:22:33,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:33,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:33,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931154568] [2019-10-13 23:22:33,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:33,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:33,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:33,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:33,425 INFO L87 Difference]: Start difference. First operand 186 states and 264 transitions. Second operand 7 states. [2019-10-13 23:22:34,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:34,676 INFO L93 Difference]: Finished difference Result 418 states and 592 transitions. [2019-10-13 23:22:34,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:22:34,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-10-13 23:22:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:34,682 INFO L225 Difference]: With dead ends: 418 [2019-10-13 23:22:34,682 INFO L226 Difference]: Without dead ends: 241 [2019-10-13 23:22:34,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-13 23:22:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2019-10-13 23:22:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-13 23:22:34,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 335 transitions. [2019-10-13 23:22:34,729 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 335 transitions. Word has length 59 [2019-10-13 23:22:34,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:34,730 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 335 transitions. [2019-10-13 23:22:34,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:34,731 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2019-10-13 23:22:34,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:22:34,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:34,737 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1173692886, now seen corresponding path program 1 times [2019-10-13 23:22:34,739 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100770718] [2019-10-13 23:22:34,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,740 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:34,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100770718] [2019-10-13 23:22:34,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:34,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901915814] [2019-10-13 23:22:34,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:34,913 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:34,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:34,914 INFO L87 Difference]: Start difference. First operand 240 states and 335 transitions. Second operand 7 states. [2019-10-13 23:22:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:35,863 INFO L93 Difference]: Finished difference Result 424 states and 600 transitions. [2019-10-13 23:22:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:22:35,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-10-13 23:22:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:35,868 INFO L225 Difference]: With dead ends: 424 [2019-10-13 23:22:35,869 INFO L226 Difference]: Without dead ends: 244 [2019-10-13 23:22:35,870 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-10-13 23:22:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2019-10-13 23:22:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-13 23:22:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 335 transitions. [2019-10-13 23:22:35,892 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 335 transitions. Word has length 60 [2019-10-13 23:22:35,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:35,893 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 335 transitions. [2019-10-13 23:22:35,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:35,893 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 335 transitions. [2019-10-13 23:22:35,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:22:35,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:35,895 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:35,895 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:35,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:35,896 INFO L82 PathProgramCache]: Analyzing trace with hash -245947725, now seen corresponding path program 1 times [2019-10-13 23:22:35,896 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:35,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849861232] [2019-10-13 23:22:35,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:35,896 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:35,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:35,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849861232] [2019-10-13 23:22:35,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:35,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:35,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13520479] [2019-10-13 23:22:35,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:35,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:35,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:36,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:36,000 INFO L87 Difference]: Start difference. First operand 240 states and 335 transitions. Second operand 5 states. [2019-10-13 23:22:36,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:36,103 INFO L93 Difference]: Finished difference Result 830 states and 1168 transitions. [2019-10-13 23:22:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:36,104 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-10-13 23:22:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:36,109 INFO L225 Difference]: With dead ends: 830 [2019-10-13 23:22:36,109 INFO L226 Difference]: Without dead ends: 615 [2019-10-13 23:22:36,111 INFO L600 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-10-13 23:22:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-10-13 23:22:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 456. [2019-10-13 23:22:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-13 23:22:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 636 transitions. [2019-10-13 23:22:36,157 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 636 transitions. Word has length 62 [2019-10-13 23:22:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:36,157 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 636 transitions. [2019-10-13 23:22:36,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 636 transitions. [2019-10-13 23:22:36,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-13 23:22:36,160 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:36,160 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:36,160 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1570515984, now seen corresponding path program 1 times [2019-10-13 23:22:36,161 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:36,161 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632859653] [2019-10-13 23:22:36,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,161 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:36,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632859653] [2019-10-13 23:22:36,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:36,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:36,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013538137] [2019-10-13 23:22:36,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:36,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:36,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:36,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:36,257 INFO L87 Difference]: Start difference. First operand 456 states and 636 transitions. Second operand 4 states. [2019-10-13 23:22:36,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:36,307 INFO L93 Difference]: Finished difference Result 832 states and 1175 transitions. [2019-10-13 23:22:36,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:36,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-10-13 23:22:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:36,312 INFO L225 Difference]: With dead ends: 832 [2019-10-13 23:22:36,312 INFO L226 Difference]: Without dead ends: 466 [2019-10-13 23:22:36,314 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:36,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-10-13 23:22:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2019-10-13 23:22:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-13 23:22:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 644 transitions. [2019-10-13 23:22:36,351 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 644 transitions. Word has length 64 [2019-10-13 23:22:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:36,352 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 644 transitions. [2019-10-13 23:22:36,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 644 transitions. [2019-10-13 23:22:36,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-13 23:22:36,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:36,354 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:36,354 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:36,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:36,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1373912432, now seen corresponding path program 1 times [2019-10-13 23:22:36,355 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:36,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824977972] [2019-10-13 23:22:36,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:36,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824977972] [2019-10-13 23:22:36,482 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:36,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:36,483 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925298876] [2019-10-13 23:22:36,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:36,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:36,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:36,487 INFO L87 Difference]: Start difference. First operand 466 states and 644 transitions. Second operand 4 states. [2019-10-13 23:22:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:36,556 INFO L93 Difference]: Finished difference Result 852 states and 1197 transitions. [2019-10-13 23:22:36,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:36,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-10-13 23:22:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:36,560 INFO L225 Difference]: With dead ends: 852 [2019-10-13 23:22:36,560 INFO L226 Difference]: Without dead ends: 476 [2019-10-13 23:22:36,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-10-13 23:22:36,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2019-10-13 23:22:36,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-10-13 23:22:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 652 transitions. [2019-10-13 23:22:36,594 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 652 transitions. Word has length 72 [2019-10-13 23:22:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:36,594 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 652 transitions. [2019-10-13 23:22:36,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 652 transitions. [2019-10-13 23:22:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 23:22:36,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:36,596 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:36,597 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1336802682, now seen corresponding path program 1 times [2019-10-13 23:22:36,597 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:36,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882482372] [2019-10-13 23:22:36,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:36,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882482372] [2019-10-13 23:22:36,698 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:36,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:36,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297531650] [2019-10-13 23:22:36,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:36,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:36,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:36,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:36,700 INFO L87 Difference]: Start difference. First operand 476 states and 652 transitions. Second operand 4 states. [2019-10-13 23:22:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:36,756 INFO L93 Difference]: Finished difference Result 870 states and 1205 transitions. [2019-10-13 23:22:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:36,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-13 23:22:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:36,764 INFO L225 Difference]: With dead ends: 870 [2019-10-13 23:22:36,764 INFO L226 Difference]: Without dead ends: 484 [2019-10-13 23:22:36,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-13 23:22:36,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-10-13 23:22:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-10-13 23:22:36,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-10-13 23:22:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 658 transitions. [2019-10-13 23:22:36,795 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 658 transitions. Word has length 80 [2019-10-13 23:22:36,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:36,796 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 658 transitions. [2019-10-13 23:22:36,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:36,796 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 658 transitions. [2019-10-13 23:22:36,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-13 23:22:36,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:36,798 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:36,798 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:36,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:36,798 INFO L82 PathProgramCache]: Analyzing trace with hash -392875626, now seen corresponding path program 1 times [2019-10-13 23:22:36,799 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:36,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572359322] [2019-10-13 23:22:36,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,799 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:36,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:36,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572359322] [2019-10-13 23:22:36,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:36,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:36,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400252235] [2019-10-13 23:22:36,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:36,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:36,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:36,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:36,908 INFO L87 Difference]: Start difference. First operand 484 states and 658 transitions. Second operand 4 states. [2019-10-13 23:22:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:36,970 INFO L93 Difference]: Finished difference Result 888 states and 1225 transitions. [2019-10-13 23:22:36,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:36,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-10-13 23:22:36,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:36,974 INFO L225 Difference]: With dead ends: 888 [2019-10-13 23:22:36,974 INFO L226 Difference]: Without dead ends: 494 [2019-10-13 23:22:36,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-13 23:22:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2019-10-13 23:22:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-10-13 23:22:37,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 666 transitions. [2019-10-13 23:22:37,021 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 666 transitions. Word has length 80 [2019-10-13 23:22:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:37,021 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 666 transitions. [2019-10-13 23:22:37,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 666 transitions. [2019-10-13 23:22:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 23:22:37,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:37,028 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:37,028 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:37,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash 871987098, now seen corresponding path program 1 times [2019-10-13 23:22:37,029 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:37,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270940117] [2019-10-13 23:22:37,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,031 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 23:22:37,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270940117] [2019-10-13 23:22:37,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:37,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:37,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120789916] [2019-10-13 23:22:37,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:37,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:37,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:37,158 INFO L87 Difference]: Start difference. First operand 494 states and 666 transitions. Second operand 4 states. [2019-10-13 23:22:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:37,233 INFO L93 Difference]: Finished difference Result 910 states and 1239 transitions. [2019-10-13 23:22:37,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:37,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 23:22:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:37,240 INFO L225 Difference]: With dead ends: 910 [2019-10-13 23:22:37,241 INFO L226 Difference]: Without dead ends: 506 [2019-10-13 23:22:37,242 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-13 23:22:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2019-10-13 23:22:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2019-10-13 23:22:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 676 transitions. [2019-10-13 23:22:37,325 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 676 transitions. Word has length 88 [2019-10-13 23:22:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:37,326 INFO L462 AbstractCegarLoop]: Abstraction has 506 states and 676 transitions. [2019-10-13 23:22:37,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 676 transitions. [2019-10-13 23:22:37,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 23:22:37,330 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:37,330 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:37,330 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:37,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:37,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1679018407, now seen corresponding path program 1 times [2019-10-13 23:22:37,331 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:37,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772822946] [2019-10-13 23:22:37,331 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:37,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 23:22:37,642 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772822946] [2019-10-13 23:22:37,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:37,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:22:37,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104118125] [2019-10-13 23:22:37,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:22:37,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:37,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:22:37,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:37,648 INFO L87 Difference]: Start difference. First operand 506 states and 676 transitions. Second operand 12 states. [2019-10-13 23:22:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:40,564 INFO L93 Difference]: Finished difference Result 1348 states and 1779 transitions. [2019-10-13 23:22:40,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:22:40,565 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-10-13 23:22:40,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:40,570 INFO L225 Difference]: With dead ends: 1348 [2019-10-13 23:22:40,570 INFO L226 Difference]: Without dead ends: 926 [2019-10-13 23:22:40,572 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2019-10-13 23:22:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 856. [2019-10-13 23:22:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-13 23:22:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1120 transitions. [2019-10-13 23:22:40,629 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1120 transitions. Word has length 93 [2019-10-13 23:22:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:40,630 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1120 transitions. [2019-10-13 23:22:40,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:22:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1120 transitions. [2019-10-13 23:22:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 23:22:40,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:40,632 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:40,632 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:40,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:40,633 INFO L82 PathProgramCache]: Analyzing trace with hash 43626938, now seen corresponding path program 1 times [2019-10-13 23:22:40,633 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:40,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257124224] [2019-10-13 23:22:40,633 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:40,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:40,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 23:22:40,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257124224] [2019-10-13 23:22:40,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:40,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:40,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337331569] [2019-10-13 23:22:40,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:40,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:40,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:40,720 INFO L87 Difference]: Start difference. First operand 856 states and 1120 transitions. Second operand 4 states. [2019-10-13 23:22:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:40,797 INFO L93 Difference]: Finished difference Result 1566 states and 2059 transitions. [2019-10-13 23:22:40,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:40,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-10-13 23:22:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:40,805 INFO L225 Difference]: With dead ends: 1566 [2019-10-13 23:22:40,805 INFO L226 Difference]: Without dead ends: 864 [2019-10-13 23:22:40,808 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-13 23:22:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-10-13 23:22:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-10-13 23:22:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-10-13 23:22:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1116 transitions. [2019-10-13 23:22:40,871 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1116 transitions. Word has length 95 [2019-10-13 23:22:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:40,871 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1116 transitions. [2019-10-13 23:22:40,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1116 transitions. [2019-10-13 23:22:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 23:22:40,873 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:40,874 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:40,874 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:40,875 INFO L82 PathProgramCache]: Analyzing trace with hash 549476847, now seen corresponding path program 1 times [2019-10-13 23:22:40,875 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:40,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776833549] [2019-10-13 23:22:40,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:40,875 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:40,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:22:40,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776833549] [2019-10-13 23:22:40,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:40,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:40,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935731524] [2019-10-13 23:22:40,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:40,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:40,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:40,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:40,978 INFO L87 Difference]: Start difference. First operand 864 states and 1116 transitions. Second operand 4 states. [2019-10-13 23:22:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:41,037 INFO L93 Difference]: Finished difference Result 1532 states and 1985 transitions. [2019-10-13 23:22:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:41,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-13 23:22:41,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:41,043 INFO L225 Difference]: With dead ends: 1532 [2019-10-13 23:22:41,043 INFO L226 Difference]: Without dead ends: 856 [2019-10-13 23:22:41,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-10-13 23:22:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2019-10-13 23:22:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2019-10-13 23:22:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1092 transitions. [2019-10-13 23:22:41,101 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1092 transitions. Word has length 97 [2019-10-13 23:22:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:41,101 INFO L462 AbstractCegarLoop]: Abstraction has 856 states and 1092 transitions. [2019-10-13 23:22:41,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:41,102 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1092 transitions. [2019-10-13 23:22:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 23:22:41,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:41,103 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:41,104 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:41,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1263786637, now seen corresponding path program 1 times [2019-10-13 23:22:41,104 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:41,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143513110] [2019-10-13 23:22:41,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:41,105 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:41,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:22:41,224 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143513110] [2019-10-13 23:22:41,224 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:41,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:41,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201715769] [2019-10-13 23:22:41,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:41,225 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:41,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:41,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:41,226 INFO L87 Difference]: Start difference. First operand 856 states and 1092 transitions. Second operand 7 states. [2019-10-13 23:22:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:41,329 INFO L93 Difference]: Finished difference Result 916 states and 1178 transitions. [2019-10-13 23:22:41,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:22:41,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2019-10-13 23:22:41,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:41,336 INFO L225 Difference]: With dead ends: 916 [2019-10-13 23:22:41,336 INFO L226 Difference]: Without dead ends: 914 [2019-10-13 23:22:41,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-10-13 23:22:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 876. [2019-10-13 23:22:41,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-13 23:22:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1114 transitions. [2019-10-13 23:22:41,410 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1114 transitions. Word has length 96 [2019-10-13 23:22:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:41,411 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1114 transitions. [2019-10-13 23:22:41,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1114 transitions. [2019-10-13 23:22:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-13 23:22:41,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:41,414 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:41,414 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:41,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:41,414 INFO L82 PathProgramCache]: Analyzing trace with hash 199062795, now seen corresponding path program 1 times [2019-10-13 23:22:41,415 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:41,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942809290] [2019-10-13 23:22:41,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:41,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:41,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:22:41,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942809290] [2019-10-13 23:22:41,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:41,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:22:41,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832394480] [2019-10-13 23:22:41,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:22:41,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:22:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:41,682 INFO L87 Difference]: Start difference. First operand 876 states and 1114 transitions. Second operand 12 states. [2019-10-13 23:22:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:45,469 INFO L93 Difference]: Finished difference Result 2482 states and 3116 transitions. [2019-10-13 23:22:45,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:22:45,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2019-10-13 23:22:45,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:45,480 INFO L225 Difference]: With dead ends: 2482 [2019-10-13 23:22:45,480 INFO L226 Difference]: Without dead ends: 1794 [2019-10-13 23:22:45,485 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2019-10-13 23:22:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1401. [2019-10-13 23:22:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-10-13 23:22:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1768 transitions. [2019-10-13 23:22:45,587 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1768 transitions. Word has length 101 [2019-10-13 23:22:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:45,587 INFO L462 AbstractCegarLoop]: Abstraction has 1401 states and 1768 transitions. [2019-10-13 23:22:45,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:22:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1768 transitions. [2019-10-13 23:22:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:45,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:45,590 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:45,591 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:45,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:45,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1539640288, now seen corresponding path program 1 times [2019-10-13 23:22:45,591 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:45,591 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746150989] [2019-10-13 23:22:45,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:22:45,874 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746150989] [2019-10-13 23:22:45,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:45,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:45,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389645241] [2019-10-13 23:22:45,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:45,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:45,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:45,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:45,876 INFO L87 Difference]: Start difference. First operand 1401 states and 1768 transitions. Second operand 9 states. [2019-10-13 23:22:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:46,993 INFO L93 Difference]: Finished difference Result 3418 states and 4363 transitions. [2019-10-13 23:22:46,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:46,993 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-10-13 23:22:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:47,011 INFO L225 Difference]: With dead ends: 3418 [2019-10-13 23:22:47,011 INFO L226 Difference]: Without dead ends: 2224 [2019-10-13 23:22:47,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:22:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2224 states. [2019-10-13 23:22:47,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2224 to 1963. [2019-10-13 23:22:47,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-10-13 23:22:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2470 transitions. [2019-10-13 23:22:47,155 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2470 transitions. Word has length 102 [2019-10-13 23:22:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:47,156 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 2470 transitions. [2019-10-13 23:22:47,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2470 transitions. [2019-10-13 23:22:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:47,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:47,158 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:47,159 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:47,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash 823112389, now seen corresponding path program 1 times [2019-10-13 23:22:47,159 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:47,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290794339] [2019-10-13 23:22:47,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:47,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:47,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:47,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290794339] [2019-10-13 23:22:47,245 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:47,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:47,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507417455] [2019-10-13 23:22:47,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:47,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:47,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:47,247 INFO L87 Difference]: Start difference. First operand 1963 states and 2470 transitions. Second operand 5 states. [2019-10-13 23:22:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:47,747 INFO L93 Difference]: Finished difference Result 6113 states and 7766 transitions. [2019-10-13 23:22:47,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:47,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 23:22:47,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:47,775 INFO L225 Difference]: With dead ends: 6113 [2019-10-13 23:22:47,775 INFO L226 Difference]: Without dead ends: 4402 [2019-10-13 23:22:47,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2019-10-13 23:22:48,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 4056. [2019-10-13 23:22:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4056 states. [2019-10-13 23:22:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 5128 transitions. [2019-10-13 23:22:48,044 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 5128 transitions. Word has length 102 [2019-10-13 23:22:48,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:48,045 INFO L462 AbstractCegarLoop]: Abstraction has 4056 states and 5128 transitions. [2019-10-13 23:22:48,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 5128 transitions. [2019-10-13 23:22:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 23:22:48,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:48,049 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:48,049 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash -637002213, now seen corresponding path program 1 times [2019-10-13 23:22:48,050 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:48,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293015279] [2019-10-13 23:22:48,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:48,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:48,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:22:48,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293015279] [2019-10-13 23:22:48,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:48,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:48,224 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489021010] [2019-10-13 23:22:48,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:48,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:48,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:48,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:48,225 INFO L87 Difference]: Start difference. First operand 4056 states and 5128 transitions. Second operand 9 states. [2019-10-13 23:22:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:49,719 INFO L93 Difference]: Finished difference Result 7974 states and 10275 transitions. [2019-10-13 23:22:49,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:22:49,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-13 23:22:49,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:49,746 INFO L225 Difference]: With dead ends: 7974 [2019-10-13 23:22:49,747 INFO L226 Difference]: Without dead ends: 4363 [2019-10-13 23:22:49,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-13 23:22:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2019-10-13 23:22:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 3801. [2019-10-13 23:22:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3801 states. [2019-10-13 23:22:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 4825 transitions. [2019-10-13 23:22:50,044 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 4825 transitions. Word has length 104 [2019-10-13 23:22:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:50,045 INFO L462 AbstractCegarLoop]: Abstraction has 3801 states and 4825 transitions. [2019-10-13 23:22:50,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 4825 transitions. [2019-10-13 23:22:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 23:22:50,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:50,049 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:50,049 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -265673379, now seen corresponding path program 1 times [2019-10-13 23:22:50,049 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:50,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137125366] [2019-10-13 23:22:50,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,050 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 23:22:50,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137125366] [2019-10-13 23:22:50,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:50,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:50,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190984236] [2019-10-13 23:22:50,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:50,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:50,143 INFO L87 Difference]: Start difference. First operand 3801 states and 4825 transitions. Second operand 4 states. [2019-10-13 23:22:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:50,390 INFO L93 Difference]: Finished difference Result 7086 states and 9072 transitions. [2019-10-13 23:22:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:50,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 23:22:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:50,411 INFO L225 Difference]: With dead ends: 7086 [2019-10-13 23:22:50,411 INFO L226 Difference]: Without dead ends: 3743 [2019-10-13 23:22:50,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3743 states. [2019-10-13 23:22:50,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3743 to 3743. [2019-10-13 23:22:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3743 states. [2019-10-13 23:22:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 4651 transitions. [2019-10-13 23:22:50,633 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 4651 transitions. Word has length 106 [2019-10-13 23:22:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:50,634 INFO L462 AbstractCegarLoop]: Abstraction has 3743 states and 4651 transitions. [2019-10-13 23:22:50,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 4651 transitions. [2019-10-13 23:22:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 23:22:50,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:50,638 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:50,638 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:50,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1486704120, now seen corresponding path program 1 times [2019-10-13 23:22:50,639 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:50,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692640850] [2019-10-13 23:22:50,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,639 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:50,712 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692640850] [2019-10-13 23:22:50,712 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:50,713 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:50,713 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513157376] [2019-10-13 23:22:50,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:50,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:50,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:50,716 INFO L87 Difference]: Start difference. First operand 3743 states and 4651 transitions. Second operand 5 states. [2019-10-13 23:22:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:51,343 INFO L93 Difference]: Finished difference Result 11140 states and 13786 transitions. [2019-10-13 23:22:51,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:51,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 23:22:51,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:51,398 INFO L225 Difference]: With dead ends: 11140 [2019-10-13 23:22:51,399 INFO L226 Difference]: Without dead ends: 7947 [2019-10-13 23:22:51,408 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7947 states. [2019-10-13 23:22:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7947 to 6284. [2019-10-13 23:22:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6284 states. [2019-10-13 23:22:51,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6284 states to 6284 states and 7766 transitions. [2019-10-13 23:22:51,819 INFO L78 Accepts]: Start accepts. Automaton has 6284 states and 7766 transitions. Word has length 106 [2019-10-13 23:22:51,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:51,820 INFO L462 AbstractCegarLoop]: Abstraction has 6284 states and 7766 transitions. [2019-10-13 23:22:51,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 6284 states and 7766 transitions. [2019-10-13 23:22:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 23:22:51,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:51,824 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:51,825 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1288049177, now seen corresponding path program 1 times [2019-10-13 23:22:51,825 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:51,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506481759] [2019-10-13 23:22:51,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:51,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:51,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:51,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506481759] [2019-10-13 23:22:51,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:51,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:51,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698386897] [2019-10-13 23:22:51,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:51,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:51,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:51,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:51,906 INFO L87 Difference]: Start difference. First operand 6284 states and 7766 transitions. Second operand 5 states. [2019-10-13 23:22:52,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:52,530 INFO L93 Difference]: Finished difference Result 14236 states and 17506 transitions. [2019-10-13 23:22:52,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:52,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 23:22:52,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:52,572 INFO L225 Difference]: With dead ends: 14236 [2019-10-13 23:22:52,572 INFO L226 Difference]: Without dead ends: 8719 [2019-10-13 23:22:52,586 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:52,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8719 states. [2019-10-13 23:22:53,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8719 to 8363. [2019-10-13 23:22:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8363 states. [2019-10-13 23:22:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8363 states to 8363 states and 10244 transitions. [2019-10-13 23:22:53,034 INFO L78 Accepts]: Start accepts. Automaton has 8363 states and 10244 transitions. Word has length 106 [2019-10-13 23:22:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:53,034 INFO L462 AbstractCegarLoop]: Abstraction has 8363 states and 10244 transitions. [2019-10-13 23:22:53,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8363 states and 10244 transitions. [2019-10-13 23:22:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 23:22:53,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:53,040 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:53,040 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:53,040 INFO L82 PathProgramCache]: Analyzing trace with hash 2008197316, now seen corresponding path program 1 times [2019-10-13 23:22:53,041 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:53,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533836072] [2019-10-13 23:22:53,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:53,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:53,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:53,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533836072] [2019-10-13 23:22:53,095 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:53,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:53,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781301496] [2019-10-13 23:22:53,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:53,096 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:53,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:53,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:53,097 INFO L87 Difference]: Start difference. First operand 8363 states and 10244 transitions. Second operand 3 states. [2019-10-13 23:22:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:53,515 INFO L93 Difference]: Finished difference Result 16004 states and 19546 transitions. [2019-10-13 23:22:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:53,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2019-10-13 23:22:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:53,546 INFO L225 Difference]: With dead ends: 16004 [2019-10-13 23:22:53,547 INFO L226 Difference]: Without dead ends: 8402 [2019-10-13 23:22:53,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8402 states. [2019-10-13 23:22:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8402 to 8369. [2019-10-13 23:22:54,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8369 states. [2019-10-13 23:22:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8369 states to 8369 states and 10250 transitions. [2019-10-13 23:22:54,121 INFO L78 Accepts]: Start accepts. Automaton has 8369 states and 10250 transitions. Word has length 107 [2019-10-13 23:22:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:54,122 INFO L462 AbstractCegarLoop]: Abstraction has 8369 states and 10250 transitions. [2019-10-13 23:22:54,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8369 states and 10250 transitions. [2019-10-13 23:22:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 23:22:54,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:54,127 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:54,128 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1337293821, now seen corresponding path program 1 times [2019-10-13 23:22:54,128 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:54,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053989082] [2019-10-13 23:22:54,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:54,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:54,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:54,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:54,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053989082] [2019-10-13 23:22:54,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:54,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:54,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973235874] [2019-10-13 23:22:54,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:54,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:54,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:54,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:54,326 INFO L87 Difference]: Start difference. First operand 8369 states and 10250 transitions. Second operand 9 states. [2019-10-13 23:22:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:55,771 INFO L93 Difference]: Finished difference Result 15928 states and 19425 transitions. [2019-10-13 23:22:55,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:22:55,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2019-10-13 23:22:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:55,803 INFO L225 Difference]: With dead ends: 15928 [2019-10-13 23:22:55,803 INFO L226 Difference]: Without dead ends: 7757 [2019-10-13 23:22:55,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:22:55,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7757 states. [2019-10-13 23:22:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7757 to 7010. [2019-10-13 23:22:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7010 states. [2019-10-13 23:22:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 8520 transitions. [2019-10-13 23:22:56,265 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 8520 transitions. Word has length 108 [2019-10-13 23:22:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:56,266 INFO L462 AbstractCegarLoop]: Abstraction has 7010 states and 8520 transitions. [2019-10-13 23:22:56,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:56,266 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 8520 transitions. [2019-10-13 23:22:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 23:22:56,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:56,269 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:56,269 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:56,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash -114490251, now seen corresponding path program 1 times [2019-10-13 23:22:56,270 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:56,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553612680] [2019-10-13 23:22:56,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:56,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:56,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:56,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553612680] [2019-10-13 23:22:56,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:56,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:56,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635124691] [2019-10-13 23:22:56,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:56,330 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:56,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:56,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:56,330 INFO L87 Difference]: Start difference. First operand 7010 states and 8520 transitions. Second operand 3 states. [2019-10-13 23:22:57,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:57,212 INFO L93 Difference]: Finished difference Result 13754 states and 16701 transitions. [2019-10-13 23:22:57,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:57,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-10-13 23:22:57,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:57,239 INFO L225 Difference]: With dead ends: 13754 [2019-10-13 23:22:57,239 INFO L226 Difference]: Without dead ends: 7052 [2019-10-13 23:22:57,250 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7052 states. [2019-10-13 23:22:57,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7052 to 7016. [2019-10-13 23:22:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7016 states. [2019-10-13 23:22:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 8526 transitions. [2019-10-13 23:22:57,649 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 8526 transitions. Word has length 109 [2019-10-13 23:22:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:57,650 INFO L462 AbstractCegarLoop]: Abstraction has 7016 states and 8526 transitions. [2019-10-13 23:22:57,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 8526 transitions. [2019-10-13 23:22:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-13 23:22:57,653 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:57,653 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:22:57,654 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:57,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:57,654 INFO L82 PathProgramCache]: Analyzing trace with hash 168460400, now seen corresponding path program 1 times [2019-10-13 23:22:57,654 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:57,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327089812] [2019-10-13 23:22:57,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:57,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:57,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:57,891 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327089812] [2019-10-13 23:22:57,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:57,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:57,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218301981] [2019-10-13 23:22:57,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:57,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:57,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:57,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:57,894 INFO L87 Difference]: Start difference. First operand 7016 states and 8526 transitions. Second operand 9 states. [2019-10-13 23:22:59,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:59,580 INFO L93 Difference]: Finished difference Result 13764 states and 16698 transitions. [2019-10-13 23:22:59,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:22:59,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-10-13 23:22:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:59,603 INFO L225 Difference]: With dead ends: 13764 [2019-10-13 23:22:59,603 INFO L226 Difference]: Without dead ends: 7054 [2019-10-13 23:22:59,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:22:59,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7054 states. [2019-10-13 23:23:00,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7054 to 6852. [2019-10-13 23:23:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6852 states. [2019-10-13 23:23:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 8312 transitions. [2019-10-13 23:23:00,083 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 8312 transitions. Word has length 109 [2019-10-13 23:23:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:23:00,084 INFO L462 AbstractCegarLoop]: Abstraction has 6852 states and 8312 transitions. [2019-10-13 23:23:00,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:23:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 8312 transitions. [2019-10-13 23:23:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 23:23:00,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:23:00,088 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 23:23:00,088 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:23:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:23:00,088 INFO L82 PathProgramCache]: Analyzing trace with hash -837998841, now seen corresponding path program 1 times [2019-10-13 23:23:00,089 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:23:00,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186149762] [2019-10-13 23:23:00,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:00,089 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:00,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:23:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:23:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:23:00,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186149762] [2019-10-13 23:23:00,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:23:00,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:23:00,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882502883] [2019-10-13 23:23:00,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:23:00,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:23:00,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:23:00,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:23:00,189 INFO L87 Difference]: Start difference. First operand 6852 states and 8312 transitions. Second operand 4 states. [2019-10-13 23:23:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:23:00,544 INFO L93 Difference]: Finished difference Result 13244 states and 16021 transitions. [2019-10-13 23:23:00,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:23:00,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-13 23:23:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:23:00,569 INFO L225 Difference]: With dead ends: 13244 [2019-10-13 23:23:00,569 INFO L226 Difference]: Without dead ends: 6696 [2019-10-13 23:23:00,581 INFO L600 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-10-13 23:23:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6696 states.