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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:25:00,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:25:00,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:25:00,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:25:00,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:25:00,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:25:00,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:25:00,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:25:00,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:25:00,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:25:00,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:25:00,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:25:00,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:25:00,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:25:00,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:25:00,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:25:00,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:25:00,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:25:00,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:25:00,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:25:00,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:25:00,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:25:00,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:25:00,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:25:00,697 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:25:00,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:25:00,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:25:00,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:25:00,699 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:25:00,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:25:00,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:25:00,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:25:00,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:25:00,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:25:00,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:25:00,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:25:00,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:25:00,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:25:00,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:25:00,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:25:00,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:25:00,708 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 21:25:00,723 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:25:00,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:25:00,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:25:00,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:25:00,725 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:25:00,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:25:00,725 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:25:00,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:25:00,726 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:25:00,726 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:25:00,726 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:25:00,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:25:00,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:25:00,727 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:25:00,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:25:00,727 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:25:00,727 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:25:00,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:25:00,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:25:00,728 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:25:00,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:25:00,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:25:00,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:25:00,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:25:00,729 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:25:00,729 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:25:00,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:25:00,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:25:00,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:25:01,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:25:01,064 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:25:01,069 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:25:01,070 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:25:01,071 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:25:01,072 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_1.ufo.UNBOUNDED.pals.c [2019-10-13 21:25:01,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0992bf0a/2f0c748487c74057afde1c4261adcb25/FLAG01233fa9e [2019-10-13 21:25:01,686 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:25:01,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-13 21:25:01,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0992bf0a/2f0c748487c74057afde1c4261adcb25/FLAG01233fa9e [2019-10-13 21:25:01,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0992bf0a/2f0c748487c74057afde1c4261adcb25 [2019-10-13 21:25:01,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:25:01,987 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:25:01,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:01,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:25:01,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:25:01,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:01" (1/1) ... [2019-10-13 21:25:01,999 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d336610 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:01, skipping insertion in model container [2019-10-13 21:25:01,999 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:01" (1/1) ... [2019-10-13 21:25:02,005 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:25:02,056 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:25:02,464 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:02,474 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:25:02,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:02,591 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:25:02,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02 WrapperNode [2019-10-13 21:25:02,592 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:02,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:25:02,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:25:02,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:25:02,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02" (1/1) ... [2019-10-13 21:25:02,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02" (1/1) ... [2019-10-13 21:25:02,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02" (1/1) ... [2019-10-13 21:25:02,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02" (1/1) ... [2019-10-13 21:25:02,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02" (1/1) ... [2019-10-13 21:25:02,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02" (1/1) ... [2019-10-13 21:25:02,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02" (1/1) ... [2019-10-13 21:25:02,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:25:02,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:25:02,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:25:02,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:25:02,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:25:02,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:25:02,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:25:02,724 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-13 21:25:02,724 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-13 21:25:02,724 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-13 21:25:02,724 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-13 21:25:02,724 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-13 21:25:02,724 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-13 21:25:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-13 21:25:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-13 21:25:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 21:25:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-13 21:25:02,725 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-13 21:25:02,726 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-13 21:25:02,726 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-13 21:25:02,726 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-13 21:25:02,729 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 21:25:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:25:02,730 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 21:25:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:25:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:25:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:25:02,730 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:25:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:25:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:25:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:25:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-13 21:25:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-13 21:25:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-13 21:25:02,731 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-13 21:25:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-13 21:25:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-13 21:25:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-13 21:25:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-13 21:25:02,732 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:25:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-13 21:25:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-13 21:25:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-13 21:25:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-13 21:25:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-13 21:25:02,733 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:25:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:25:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:25:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:25:03,604 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:25:03,604 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:25:03,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:03 BoogieIcfgContainer [2019-10-13 21:25:03,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:25:03,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:25:03,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:25:03,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:25:03,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:25:01" (1/3) ... [2019-10-13 21:25:03,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5444657f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:03, skipping insertion in model container [2019-10-13 21:25:03,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:02" (2/3) ... [2019-10-13 21:25:03,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5444657f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:03, skipping insertion in model container [2019-10-13 21:25:03,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:03" (3/3) ... [2019-10-13 21:25:03,615 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-13 21:25:03,625 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:25:03,636 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:25:03,648 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:25:03,677 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:25:03,678 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:25:03,678 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:25:03,678 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:25:03,678 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:25:03,679 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:25:03,679 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:25:03,679 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:25:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states. [2019-10-13 21:25:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 21:25:03,714 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:03,716 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] [2019-10-13 21:25:03,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:03,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:03,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1914592099, now seen corresponding path program 1 times [2019-10-13 21:25:03,735 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:03,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364760659] [2019-10-13 21:25:03,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:03,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:03,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:04,163 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 21:25:04,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364760659] [2019-10-13 21:25:04,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:04,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:04,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510429909] [2019-10-13 21:25:04,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:04,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:04,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:04,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:04,192 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 4 states. [2019-10-13 21:25:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:04,307 INFO L93 Difference]: Finished difference Result 444 states and 684 transitions. [2019-10-13 21:25:04,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:04,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-13 21:25:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:04,334 INFO L225 Difference]: With dead ends: 444 [2019-10-13 21:25:04,334 INFO L226 Difference]: Without dead ends: 229 [2019-10-13 21:25:04,340 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-13 21:25:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2019-10-13 21:25:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-13 21:25:04,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 319 transitions. [2019-10-13 21:25:04,409 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 319 transitions. Word has length 65 [2019-10-13 21:25:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:04,409 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 319 transitions. [2019-10-13 21:25:04,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 319 transitions. [2019-10-13 21:25:04,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 21:25:04,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:04,414 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] [2019-10-13 21:25:04,414 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:04,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash 2098614595, now seen corresponding path program 1 times [2019-10-13 21:25:04,415 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:04,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922310963] [2019-10-13 21:25:04,416 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,416 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:04,670 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 21:25:04,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922310963] [2019-10-13 21:25:04,671 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:04,671 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:04,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454670991] [2019-10-13 21:25:04,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:04,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:04,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:04,676 INFO L87 Difference]: Start difference. First operand 229 states and 319 transitions. Second operand 4 states. [2019-10-13 21:25:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:04,776 INFO L93 Difference]: Finished difference Result 440 states and 626 transitions. [2019-10-13 21:25:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:04,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-13 21:25:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:04,781 INFO L225 Difference]: With dead ends: 440 [2019-10-13 21:25:04,781 INFO L226 Difference]: Without dead ends: 233 [2019-10-13 21:25:04,783 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 21:25:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-13 21:25:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2019-10-13 21:25:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-13 21:25:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 322 transitions. [2019-10-13 21:25:04,809 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 322 transitions. Word has length 76 [2019-10-13 21:25:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:04,809 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 322 transitions. [2019-10-13 21:25:04,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 322 transitions. [2019-10-13 21:25:04,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:25:04,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:04,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:04,814 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:04,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:04,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1135646998, now seen corresponding path program 1 times [2019-10-13 21:25:04,815 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:04,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317236328] [2019-10-13 21:25:04,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:05,014 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 21:25:05,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317236328] [2019-10-13 21:25:05,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:05,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:05,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768686349] [2019-10-13 21:25:05,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:05,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:05,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:05,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:05,017 INFO L87 Difference]: Start difference. First operand 233 states and 322 transitions. Second operand 7 states. [2019-10-13 21:25:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:06,333 INFO L93 Difference]: Finished difference Result 531 states and 736 transitions. [2019-10-13 21:25:06,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:06,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-13 21:25:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:06,339 INFO L225 Difference]: With dead ends: 531 [2019-10-13 21:25:06,339 INFO L226 Difference]: Without dead ends: 320 [2019-10-13 21:25:06,341 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 21:25:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-10-13 21:25:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2019-10-13 21:25:06,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-13 21:25:06,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 434 transitions. [2019-10-13 21:25:06,402 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 434 transitions. Word has length 94 [2019-10-13 21:25:06,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:06,403 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 434 transitions. [2019-10-13 21:25:06,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 434 transitions. [2019-10-13 21:25:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:25:06,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:06,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:06,413 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:06,414 INFO L82 PathProgramCache]: Analyzing trace with hash -376916963, now seen corresponding path program 1 times [2019-10-13 21:25:06,414 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:06,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779885428] [2019-10-13 21:25:06,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:06,543 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 21:25:06,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779885428] [2019-10-13 21:25:06,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:06,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:06,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678810249] [2019-10-13 21:25:06,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:06,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:06,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:06,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:06,547 INFO L87 Difference]: Start difference. First operand 319 states and 434 transitions. Second operand 7 states. [2019-10-13 21:25:07,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:07,709 INFO L93 Difference]: Finished difference Result 537 states and 744 transitions. [2019-10-13 21:25:07,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:07,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:25:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:07,713 INFO L225 Difference]: With dead ends: 537 [2019-10-13 21:25:07,713 INFO L226 Difference]: Without dead ends: 323 [2019-10-13 21:25:07,714 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 21:25:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-13 21:25:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2019-10-13 21:25:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2019-10-13 21:25:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 434 transitions. [2019-10-13 21:25:07,737 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 434 transitions. Word has length 95 [2019-10-13 21:25:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:07,737 INFO L462 AbstractCegarLoop]: Abstraction has 319 states and 434 transitions. [2019-10-13 21:25:07,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:07,738 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 434 transitions. [2019-10-13 21:25:07,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:25:07,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:07,740 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:07,740 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:07,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:07,741 INFO L82 PathProgramCache]: Analyzing trace with hash 121472215, now seen corresponding path program 1 times [2019-10-13 21:25:07,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:07,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889082820] [2019-10-13 21:25:07,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:07,742 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:07,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:07,828 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 21:25:07,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889082820] [2019-10-13 21:25:07,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:07,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:07,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689755632] [2019-10-13 21:25:07,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:07,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:07,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:07,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:07,831 INFO L87 Difference]: Start difference. First operand 319 states and 434 transitions. Second operand 3 states. [2019-10-13 21:25:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:07,880 INFO L93 Difference]: Finished difference Result 764 states and 1063 transitions. [2019-10-13 21:25:07,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:07,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-13 21:25:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:07,886 INFO L225 Difference]: With dead ends: 764 [2019-10-13 21:25:07,887 INFO L226 Difference]: Without dead ends: 550 [2019-10-13 21:25:07,888 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 21:25:07,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-13 21:25:07,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 533. [2019-10-13 21:25:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-13 21:25:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 737 transitions. [2019-10-13 21:25:07,934 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 737 transitions. Word has length 96 [2019-10-13 21:25:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:07,935 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 737 transitions. [2019-10-13 21:25:07,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 737 transitions. [2019-10-13 21:25:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:25:07,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:07,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:07,938 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:07,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1774390923, now seen corresponding path program 1 times [2019-10-13 21:25:07,939 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:07,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827130401] [2019-10-13 21:25:07,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:07,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:07,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:08,020 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 21:25:08,021 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827130401] [2019-10-13 21:25:08,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:08,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:08,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946609353] [2019-10-13 21:25:08,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:08,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:08,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:08,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:08,023 INFO L87 Difference]: Start difference. First operand 533 states and 737 transitions. Second operand 3 states. [2019-10-13 21:25:08,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:08,112 INFO L93 Difference]: Finished difference Result 1266 states and 1792 transitions. [2019-10-13 21:25:08,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:08,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-13 21:25:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:08,120 INFO L225 Difference]: With dead ends: 1266 [2019-10-13 21:25:08,120 INFO L226 Difference]: Without dead ends: 881 [2019-10-13 21:25:08,122 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 21:25:08,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-10-13 21:25:08,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 875. [2019-10-13 21:25:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-10-13 21:25:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1228 transitions. [2019-10-13 21:25:08,191 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1228 transitions. Word has length 97 [2019-10-13 21:25:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:08,192 INFO L462 AbstractCegarLoop]: Abstraction has 875 states and 1228 transitions. [2019-10-13 21:25:08,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1228 transitions. [2019-10-13 21:25:08,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:25:08,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:08,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:08,195 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:08,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:08,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1073326345, now seen corresponding path program 1 times [2019-10-13 21:25:08,196 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:08,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451534444] [2019-10-13 21:25:08,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:08,280 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 21:25:08,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451534444] [2019-10-13 21:25:08,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:08,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:08,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28999497] [2019-10-13 21:25:08,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:08,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:08,283 INFO L87 Difference]: Start difference. First operand 875 states and 1228 transitions. Second operand 3 states. [2019-10-13 21:25:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:08,344 INFO L93 Difference]: Finished difference Result 1475 states and 2083 transitions. [2019-10-13 21:25:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:08,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-13 21:25:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:08,353 INFO L225 Difference]: With dead ends: 1475 [2019-10-13 21:25:08,354 INFO L226 Difference]: Without dead ends: 716 [2019-10-13 21:25:08,360 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 21:25:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-10-13 21:25:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-10-13 21:25:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-10-13 21:25:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 996 transitions. [2019-10-13 21:25:08,432 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 996 transitions. Word has length 97 [2019-10-13 21:25:08,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:08,432 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 996 transitions. [2019-10-13 21:25:08,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 996 transitions. [2019-10-13 21:25:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:25:08,435 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:08,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:08,436 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:08,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:08,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1721002108, now seen corresponding path program 1 times [2019-10-13 21:25:08,437 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:08,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562280549] [2019-10-13 21:25:08,437 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,438 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:08,553 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 21:25:08,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562280549] [2019-10-13 21:25:08,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:08,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:08,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527484782] [2019-10-13 21:25:08,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:08,556 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:08,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:08,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:08,557 INFO L87 Difference]: Start difference. First operand 716 states and 996 transitions. Second operand 4 states. [2019-10-13 21:25:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:08,639 INFO L93 Difference]: Finished difference Result 1296 states and 1829 transitions. [2019-10-13 21:25:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:08,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-13 21:25:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:08,647 INFO L225 Difference]: With dead ends: 1296 [2019-10-13 21:25:08,647 INFO L226 Difference]: Without dead ends: 731 [2019-10-13 21:25:08,651 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 21:25:08,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-10-13 21:25:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-10-13 21:25:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-10-13 21:25:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1008 transitions. [2019-10-13 21:25:08,703 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1008 transitions. Word has length 97 [2019-10-13 21:25:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:08,704 INFO L462 AbstractCegarLoop]: Abstraction has 731 states and 1008 transitions. [2019-10-13 21:25:08,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1008 transitions. [2019-10-13 21:25:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:25:08,706 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:08,707 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, 1, 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 21:25:08,707 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:08,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash 190055260, now seen corresponding path program 1 times [2019-10-13 21:25:08,708 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:08,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028778632] [2019-10-13 21:25:08,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,708 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:08,796 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 21:25:08,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028778632] [2019-10-13 21:25:08,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:08,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:08,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101824706] [2019-10-13 21:25:08,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:08,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:08,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:08,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:08,798 INFO L87 Difference]: Start difference. First operand 731 states and 1008 transitions. Second operand 4 states. [2019-10-13 21:25:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:08,909 INFO L93 Difference]: Finished difference Result 1326 states and 1862 transitions. [2019-10-13 21:25:08,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:08,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 21:25:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:08,916 INFO L225 Difference]: With dead ends: 1326 [2019-10-13 21:25:08,916 INFO L226 Difference]: Without dead ends: 746 [2019-10-13 21:25:08,919 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 21:25:08,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2019-10-13 21:25:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2019-10-13 21:25:08,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-10-13 21:25:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1020 transitions. [2019-10-13 21:25:08,970 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1020 transitions. Word has length 105 [2019-10-13 21:25:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:08,970 INFO L462 AbstractCegarLoop]: Abstraction has 746 states and 1020 transitions. [2019-10-13 21:25:08,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1020 transitions. [2019-10-13 21:25:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:25:08,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:08,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:25:08,973 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:08,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:08,974 INFO L82 PathProgramCache]: Analyzing trace with hash 338939110, now seen corresponding path program 1 times [2019-10-13 21:25:08,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:08,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315579251] [2019-10-13 21:25:08,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,975 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:08,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:09,060 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 21:25:09,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315579251] [2019-10-13 21:25:09,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:09,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:09,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295276093] [2019-10-13 21:25:09,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:09,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:09,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:09,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:09,063 INFO L87 Difference]: Start difference. First operand 746 states and 1020 transitions. Second operand 4 states. [2019-10-13 21:25:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:09,130 INFO L93 Difference]: Finished difference Result 1353 states and 1874 transitions. [2019-10-13 21:25:09,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:09,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:25:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:09,135 INFO L225 Difference]: With dead ends: 1353 [2019-10-13 21:25:09,136 INFO L226 Difference]: Without dead ends: 758 [2019-10-13 21:25:09,139 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 21:25:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-10-13 21:25:09,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2019-10-13 21:25:09,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-10-13 21:25:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1029 transitions. [2019-10-13 21:25:09,184 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1029 transitions. Word has length 113 [2019-10-13 21:25:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:09,184 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1029 transitions. [2019-10-13 21:25:09,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1029 transitions. [2019-10-13 21:25:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:25:09,187 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:09,187 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:25:09,187 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:09,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:09,188 INFO L82 PathProgramCache]: Analyzing trace with hash 462889986, now seen corresponding path program 1 times [2019-10-13 21:25:09,188 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:09,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412379529] [2019-10-13 21:25:09,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,188 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:09,285 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 21:25:09,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412379529] [2019-10-13 21:25:09,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:09,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:09,286 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332908639] [2019-10-13 21:25:09,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:09,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:09,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:09,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:09,288 INFO L87 Difference]: Start difference. First operand 758 states and 1029 transitions. Second operand 4 states. [2019-10-13 21:25:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:09,371 INFO L93 Difference]: Finished difference Result 1380 states and 1904 transitions. [2019-10-13 21:25:09,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:09,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:25:09,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:09,378 INFO L225 Difference]: With dead ends: 1380 [2019-10-13 21:25:09,378 INFO L226 Difference]: Without dead ends: 773 [2019-10-13 21:25:09,381 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 21:25:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-13 21:25:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2019-10-13 21:25:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-13 21:25:09,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1041 transitions. [2019-10-13 21:25:09,425 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1041 transitions. Word has length 113 [2019-10-13 21:25:09,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:09,425 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1041 transitions. [2019-10-13 21:25:09,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1041 transitions. [2019-10-13 21:25:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:25:09,430 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:09,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:25:09,430 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:09,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:09,430 INFO L82 PathProgramCache]: Analyzing trace with hash 397660294, now seen corresponding path program 1 times [2019-10-13 21:25:09,431 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:09,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636328024] [2019-10-13 21:25:09,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:09,562 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 21:25:09,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636328024] [2019-10-13 21:25:09,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:09,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:09,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358495478] [2019-10-13 21:25:09,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:09,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:09,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:09,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:09,565 INFO L87 Difference]: Start difference. First operand 773 states and 1041 transitions. Second operand 4 states. [2019-10-13 21:25:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:09,661 INFO L93 Difference]: Finished difference Result 1413 states and 1925 transitions. [2019-10-13 21:25:09,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:09,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-13 21:25:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:09,671 INFO L225 Difference]: With dead ends: 1413 [2019-10-13 21:25:09,672 INFO L226 Difference]: Without dead ends: 791 [2019-10-13 21:25:09,676 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 21:25:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-10-13 21:25:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 791. [2019-10-13 21:25:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-10-13 21:25:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1056 transitions. [2019-10-13 21:25:09,814 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1056 transitions. Word has length 121 [2019-10-13 21:25:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:09,816 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1056 transitions. [2019-10-13 21:25:09,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1056 transitions. [2019-10-13 21:25:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 21:25:09,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:09,819 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:25:09,820 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:09,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:09,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1636035475, now seen corresponding path program 1 times [2019-10-13 21:25:09,820 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:09,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652766678] [2019-10-13 21:25:09,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,821 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:10,102 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 21:25:10,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652766678] [2019-10-13 21:25:10,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:10,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:25:10,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306703129] [2019-10-13 21:25:10,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:25:10,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:10,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:25:10,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:25:10,105 INFO L87 Difference]: Start difference. First operand 791 states and 1056 transitions. Second operand 10 states. [2019-10-13 21:25:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:12,694 INFO L93 Difference]: Finished difference Result 2065 states and 2738 transitions. [2019-10-13 21:25:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:25:12,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-10-13 21:25:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:12,704 INFO L225 Difference]: With dead ends: 2065 [2019-10-13 21:25:12,704 INFO L226 Difference]: Without dead ends: 1416 [2019-10-13 21:25:12,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:25:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2019-10-13 21:25:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1323. [2019-10-13 21:25:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2019-10-13 21:25:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1734 transitions. [2019-10-13 21:25:12,796 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1734 transitions. Word has length 126 [2019-10-13 21:25:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:12,796 INFO L462 AbstractCegarLoop]: Abstraction has 1323 states and 1734 transitions. [2019-10-13 21:25:12,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:25:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1734 transitions. [2019-10-13 21:25:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:25:12,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:12,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:12,800 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:12,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1962229945, now seen corresponding path program 1 times [2019-10-13 21:25:12,801 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:12,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553836075] [2019-10-13 21:25:12,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:12,926 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 21:25:12,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553836075] [2019-10-13 21:25:12,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:12,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:12,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225557004] [2019-10-13 21:25:12,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:12,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:12,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:12,928 INFO L87 Difference]: Start difference. First operand 1323 states and 1734 transitions. Second operand 4 states. [2019-10-13 21:25:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:13,035 INFO L93 Difference]: Finished difference Result 2404 states and 3173 transitions. [2019-10-13 21:25:13,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:13,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-13 21:25:13,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:13,045 INFO L225 Difference]: With dead ends: 2404 [2019-10-13 21:25:13,045 INFO L226 Difference]: Without dead ends: 1335 [2019-10-13 21:25:13,050 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 21:25:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2019-10-13 21:25:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1329. [2019-10-13 21:25:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-10-13 21:25:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1721 transitions. [2019-10-13 21:25:13,125 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1721 transitions. Word has length 128 [2019-10-13 21:25:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:13,125 INFO L462 AbstractCegarLoop]: Abstraction has 1329 states and 1721 transitions. [2019-10-13 21:25:13,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1721 transitions. [2019-10-13 21:25:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:25:13,128 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:13,128 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:25:13,128 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:13,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:13,129 INFO L82 PathProgramCache]: Analyzing trace with hash -287290418, now seen corresponding path program 1 times [2019-10-13 21:25:13,129 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:13,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741895229] [2019-10-13 21:25:13,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:25:13,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741895229] [2019-10-13 21:25:13,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:13,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:13,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904834157] [2019-10-13 21:25:13,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:13,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:13,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:13,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:13,328 INFO L87 Difference]: Start difference. First operand 1329 states and 1721 transitions. Second operand 9 states. [2019-10-13 21:25:15,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:15,258 INFO L93 Difference]: Finished difference Result 2737 states and 3519 transitions. [2019-10-13 21:25:15,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:25:15,258 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-10-13 21:25:15,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:15,272 INFO L225 Difference]: With dead ends: 2737 [2019-10-13 21:25:15,273 INFO L226 Difference]: Without dead ends: 1713 [2019-10-13 21:25:15,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:25:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2019-10-13 21:25:15,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1452. [2019-10-13 21:25:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-10-13 21:25:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1855 transitions. [2019-10-13 21:25:15,402 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1855 transitions. Word has length 130 [2019-10-13 21:25:15,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:15,402 INFO L462 AbstractCegarLoop]: Abstraction has 1452 states and 1855 transitions. [2019-10-13 21:25:15,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1855 transitions. [2019-10-13 21:25:15,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:25:15,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:15,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:25:15,406 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:15,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:15,407 INFO L82 PathProgramCache]: Analyzing trace with hash 99662188, now seen corresponding path program 1 times [2019-10-13 21:25:15,407 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:15,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162825639] [2019-10-13 21:25:15,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:15,546 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 21:25:15,550 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162825639] [2019-10-13 21:25:15,551 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:15,551 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:15,551 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743392741] [2019-10-13 21:25:15,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:15,552 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:15,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:15,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:15,553 INFO L87 Difference]: Start difference. First operand 1452 states and 1855 transitions. Second operand 7 states. [2019-10-13 21:25:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:15,659 INFO L93 Difference]: Finished difference Result 1551 states and 1996 transitions. [2019-10-13 21:25:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:25:15,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-10-13 21:25:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:15,669 INFO L225 Difference]: With dead ends: 1551 [2019-10-13 21:25:15,669 INFO L226 Difference]: Without dead ends: 1549 [2019-10-13 21:25:15,670 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 21:25:15,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2019-10-13 21:25:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1473. [2019-10-13 21:25:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1473 states. [2019-10-13 21:25:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 1878 transitions. [2019-10-13 21:25:15,770 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 1878 transitions. Word has length 129 [2019-10-13 21:25:15,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:15,770 INFO L462 AbstractCegarLoop]: Abstraction has 1473 states and 1878 transitions. [2019-10-13 21:25:15,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:15,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1878 transitions. [2019-10-13 21:25:15,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:25:15,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:15,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:25:15,774 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:15,774 INFO L82 PathProgramCache]: Analyzing trace with hash -563839625, now seen corresponding path program 1 times [2019-10-13 21:25:15,775 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:15,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124169043] [2019-10-13 21:25:15,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,775 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:15,972 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 21:25:15,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124169043] [2019-10-13 21:25:15,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:15,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:25:15,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408521319] [2019-10-13 21:25:15,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:25:15,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:15,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:25:15,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:25:15,974 INFO L87 Difference]: Start difference. First operand 1473 states and 1878 transitions. Second operand 10 states. [2019-10-13 21:25:19,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:19,213 INFO L93 Difference]: Finished difference Result 3867 states and 4909 transitions. [2019-10-13 21:25:19,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:25:19,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2019-10-13 21:25:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:19,235 INFO L225 Difference]: With dead ends: 3867 [2019-10-13 21:25:19,235 INFO L226 Difference]: Without dead ends: 2741 [2019-10-13 21:25:19,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:25:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2019-10-13 21:25:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 1898. [2019-10-13 21:25:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2019-10-13 21:25:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2408 transitions. [2019-10-13 21:25:19,422 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 2408 transitions. Word has length 134 [2019-10-13 21:25:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:19,422 INFO L462 AbstractCegarLoop]: Abstraction has 1898 states and 2408 transitions. [2019-10-13 21:25:19,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:25:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 2408 transitions. [2019-10-13 21:25:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:25:19,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:19,427 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, 1, 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 21:25:19,428 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:19,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:19,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1781848955, now seen corresponding path program 1 times [2019-10-13 21:25:19,429 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:19,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763319769] [2019-10-13 21:25:19,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:19,588 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 21:25:19,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763319769] [2019-10-13 21:25:19,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:19,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:19,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855383067] [2019-10-13 21:25:19,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:19,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:19,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:19,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:19,591 INFO L87 Difference]: Start difference. First operand 1898 states and 2408 transitions. Second operand 5 states. [2019-10-13 21:25:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:20,410 INFO L93 Difference]: Finished difference Result 6566 states and 8442 transitions. [2019-10-13 21:25:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:20,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-13 21:25:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:20,449 INFO L225 Difference]: With dead ends: 6566 [2019-10-13 21:25:20,449 INFO L226 Difference]: Without dead ends: 4960 [2019-10-13 21:25:20,461 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 21:25:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2019-10-13 21:25:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4504. [2019-10-13 21:25:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4504 states. [2019-10-13 21:25:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 5734 transitions. [2019-10-13 21:25:20,808 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 5734 transitions. Word has length 135 [2019-10-13 21:25:20,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:20,809 INFO L462 AbstractCegarLoop]: Abstraction has 4504 states and 5734 transitions. [2019-10-13 21:25:20,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 5734 transitions. [2019-10-13 21:25:20,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:25:20,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:20,814 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, 1, 1, 1, 1, 1, 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 21:25:20,814 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1847941033, now seen corresponding path program 1 times [2019-10-13 21:25:20,815 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:20,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045159446] [2019-10-13 21:25:20,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,815 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:20,945 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 21:25:20,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045159446] [2019-10-13 21:25:20,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:20,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:20,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879461406] [2019-10-13 21:25:20,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:20,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:20,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:20,949 INFO L87 Difference]: Start difference. First operand 4504 states and 5734 transitions. Second operand 4 states. [2019-10-13 21:25:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:21,447 INFO L93 Difference]: Finished difference Result 8456 states and 10801 transitions. [2019-10-13 21:25:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:21,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:25:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:21,480 INFO L225 Difference]: With dead ends: 8456 [2019-10-13 21:25:21,481 INFO L226 Difference]: Without dead ends: 4541 [2019-10-13 21:25:21,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:21,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4541 states. [2019-10-13 21:25:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4541 to 4122. [2019-10-13 21:25:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4122 states. [2019-10-13 21:25:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4122 states to 4122 states and 5249 transitions. [2019-10-13 21:25:21,907 INFO L78 Accepts]: Start accepts. Automaton has 4122 states and 5249 transitions. Word has length 139 [2019-10-13 21:25:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:21,909 INFO L462 AbstractCegarLoop]: Abstraction has 4122 states and 5249 transitions. [2019-10-13 21:25:21,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 4122 states and 5249 transitions. [2019-10-13 21:25:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:25:21,912 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:21,913 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, 1, 1, 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 21:25:21,913 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:21,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1695535937, now seen corresponding path program 1 times [2019-10-13 21:25:21,914 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:21,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531070586] [2019-10-13 21:25:21,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:21,915 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:21,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:22,152 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 21:25:22,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531070586] [2019-10-13 21:25:22,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:22,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:22,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286823857] [2019-10-13 21:25:22,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:22,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:22,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:22,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:22,155 INFO L87 Difference]: Start difference. First operand 4122 states and 5249 transitions. Second operand 9 states. [2019-10-13 21:25:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:23,415 INFO L93 Difference]: Finished difference Result 7550 states and 9682 transitions. [2019-10-13 21:25:23,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:25:23,416 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-10-13 21:25:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:23,455 INFO L225 Difference]: With dead ends: 7550 [2019-10-13 21:25:23,455 INFO L226 Difference]: Without dead ends: 3839 [2019-10-13 21:25:23,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:25:23,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2019-10-13 21:25:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3482. [2019-10-13 21:25:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2019-10-13 21:25:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 4424 transitions. [2019-10-13 21:25:23,761 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 4424 transitions. Word has length 136 [2019-10-13 21:25:23,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:23,762 INFO L462 AbstractCegarLoop]: Abstraction has 3482 states and 4424 transitions. [2019-10-13 21:25:23,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 4424 transitions. [2019-10-13 21:25:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:25:23,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:23,765 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, 1, 1, 1, 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 21:25:23,766 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:23,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1308999803, now seen corresponding path program 1 times [2019-10-13 21:25:23,766 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:23,767 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709748380] [2019-10-13 21:25:23,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:23,946 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 21:25:23,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709748380] [2019-10-13 21:25:23,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:23,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:23,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189287938] [2019-10-13 21:25:23,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:23,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:23,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:23,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:23,955 INFO L87 Difference]: Start difference. First operand 3482 states and 4424 transitions. Second operand 9 states. [2019-10-13 21:25:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,592 INFO L93 Difference]: Finished difference Result 7075 states and 9138 transitions. [2019-10-13 21:25:25,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:25:25,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-10-13 21:25:25,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,612 INFO L225 Difference]: With dead ends: 7075 [2019-10-13 21:25:25,612 INFO L226 Difference]: Without dead ends: 3943 [2019-10-13 21:25:25,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:25:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2019-10-13 21:25:25,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3381. [2019-10-13 21:25:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3381 states. [2019-10-13 21:25:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4295 transitions. [2019-10-13 21:25:25,925 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4295 transitions. Word has length 137 [2019-10-13 21:25:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,925 INFO L462 AbstractCegarLoop]: Abstraction has 3381 states and 4295 transitions. [2019-10-13 21:25:25,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4295 transitions. [2019-10-13 21:25:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:25:25,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,928 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, 1, 1, 1, 1, 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 21:25:25,928 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1491067408, now seen corresponding path program 1 times [2019-10-13 21:25:25,929 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327447937] [2019-10-13 21:25:25,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,929 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:26,013 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 21:25:26,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327447937] [2019-10-13 21:25:26,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:26,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:26,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398131421] [2019-10-13 21:25:26,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:26,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:26,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:26,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:26,016 INFO L87 Difference]: Start difference. First operand 3381 states and 4295 transitions. Second operand 5 states. [2019-10-13 21:25:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:26,682 INFO L93 Difference]: Finished difference Result 10413 states and 13355 transitions. [2019-10-13 21:25:26,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:26,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-13 21:25:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:26,740 INFO L225 Difference]: With dead ends: 10413 [2019-10-13 21:25:26,741 INFO L226 Difference]: Without dead ends: 7541 [2019-10-13 21:25:26,753 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 21:25:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7541 states. [2019-10-13 21:25:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7541 to 5188. [2019-10-13 21:25:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5188 states. [2019-10-13 21:25:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 6581 transitions. [2019-10-13 21:25:27,225 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 6581 transitions. Word has length 138 [2019-10-13 21:25:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:27,226 INFO L462 AbstractCegarLoop]: Abstraction has 5188 states and 6581 transitions. [2019-10-13 21:25:27,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 6581 transitions. [2019-10-13 21:25:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:25:27,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:27,230 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, 1, 1, 1, 1, 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 21:25:27,230 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1745801643, now seen corresponding path program 1 times [2019-10-13 21:25:27,231 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:27,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199628534] [2019-10-13 21:25:27,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:27,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:27,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:27,340 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 21:25:27,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199628534] [2019-10-13 21:25:27,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:27,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:27,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900633618] [2019-10-13 21:25:27,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:27,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:27,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:27,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:27,343 INFO L87 Difference]: Start difference. First operand 5188 states and 6581 transitions. Second operand 5 states. [2019-10-13 21:25:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:27,955 INFO L93 Difference]: Finished difference Result 12039 states and 15339 transitions. [2019-10-13 21:25:27,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:27,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-13 21:25:27,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:27,984 INFO L225 Difference]: With dead ends: 12039 [2019-10-13 21:25:27,985 INFO L226 Difference]: Without dead ends: 7495 [2019-10-13 21:25:27,999 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 21:25:28,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7495 states. [2019-10-13 21:25:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7495 to 6951. [2019-10-13 21:25:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6951 states. [2019-10-13 21:25:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6951 states to 6951 states and 8771 transitions. [2019-10-13 21:25:28,936 INFO L78 Accepts]: Start accepts. Automaton has 6951 states and 8771 transitions. Word has length 138 [2019-10-13 21:25:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:28,936 INFO L462 AbstractCegarLoop]: Abstraction has 6951 states and 8771 transitions. [2019-10-13 21:25:28,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 6951 states and 8771 transitions. [2019-10-13 21:25:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:25:28,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:28,941 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, 1, 1, 1, 1, 1, 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 21:25:28,941 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:28,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:28,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1645561488, now seen corresponding path program 1 times [2019-10-13 21:25:28,942 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:28,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567324880] [2019-10-13 21:25:28,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:28,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:28,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:28,996 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 21:25:28,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567324880] [2019-10-13 21:25:28,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:28,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:28,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607154723] [2019-10-13 21:25:28,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:28,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:28,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:28,998 INFO L87 Difference]: Start difference. First operand 6951 states and 8771 transitions. Second operand 3 states. [2019-10-13 21:25:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:29,363 INFO L93 Difference]: Finished difference Result 13391 states and 16973 transitions. [2019-10-13 21:25:29,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:29,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-13 21:25:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:29,390 INFO L225 Difference]: With dead ends: 13391 [2019-10-13 21:25:29,391 INFO L226 Difference]: Without dead ends: 7020 [2019-10-13 21:25:29,408 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 21:25:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7020 states. [2019-10-13 21:25:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7020 to 6957. [2019-10-13 21:25:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6957 states. [2019-10-13 21:25:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6957 states to 6957 states and 8777 transitions. [2019-10-13 21:25:29,892 INFO L78 Accepts]: Start accepts. Automaton has 6957 states and 8777 transitions. Word has length 139 [2019-10-13 21:25:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:29,892 INFO L462 AbstractCegarLoop]: Abstraction has 6957 states and 8777 transitions. [2019-10-13 21:25:29,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 6957 states and 8777 transitions. [2019-10-13 21:25:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:25:29,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:29,898 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, 1, 1, 1, 1, 1, 1, 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 21:25:29,898 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:29,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:29,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1802829423, now seen corresponding path program 1 times [2019-10-13 21:25:29,899 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:29,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468337107] [2019-10-13 21:25:29,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:29,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:29,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:30,342 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 21:25:30,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468337107] [2019-10-13 21:25:30,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:30,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:25:30,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63620135] [2019-10-13 21:25:30,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:25:30,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:30,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:25:30,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:25:30,345 INFO L87 Difference]: Start difference. First operand 6957 states and 8777 transitions. Second operand 12 states. [2019-10-13 21:25:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:33,919 INFO L93 Difference]: Finished difference Result 14024 states and 17715 transitions. [2019-10-13 21:25:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 21:25:33,919 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-10-13 21:25:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:33,941 INFO L225 Difference]: With dead ends: 14024 [2019-10-13 21:25:33,941 INFO L226 Difference]: Without dead ends: 7224 [2019-10-13 21:25:33,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-10-13 21:25:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states.