java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 15:54:00,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 15:54:00,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 15:54:00,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 15:54:00,568 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 15:54:00,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 15:54:00,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 15:54:00,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 15:54:00,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 15:54:00,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 15:54:00,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 15:54:00,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 15:54:00,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 15:54:00,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 15:54:00,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 15:54:00,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 15:54:00,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 15:54:00,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 15:54:00,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 15:54:00,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 15:54:00,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 15:54:00,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 15:54:00,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 15:54:00,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 15:54:00,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 15:54:00,615 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 15:54:00,615 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 15:54:00,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 15:54:00,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 15:54:00,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 15:54:00,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 15:54:00,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 15:54:00,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 15:54:00,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 15:54:00,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 15:54:00,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 15:54:00,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 15:54:00,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 15:54:00,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 15:54:00,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 15:54:00,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 15:54:00,630 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-07 15:54:00,650 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 15:54:00,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 15:54:00,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 15:54:00,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 15:54:00,652 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 15:54:00,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 15:54:00,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 15:54:00,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 15:54:00,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 15:54:00,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 15:54:00,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 15:54:00,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 15:54:00,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 15:54:00,655 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 15:54:00,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 15:54:00,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 15:54:00,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 15:54:00,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 15:54:00,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 15:54:00,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 15:54:00,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 15:54:00,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 15:54:00,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 15:54:00,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 15:54:00,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 15:54:00,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 15:54:00,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 15:54:00,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 15:54:00,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 15:54:00,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 15:54:00,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 15:54:00,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 15:54:00,943 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 15:54:00,944 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 15:54:00,945 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.BOUNDED-10.pals.c [2019-10-07 15:54:01,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9583a595/cf3c85ea13394b4586f88a02fba46a17/FLAG49d5b3abd [2019-10-07 15:54:01,536 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 15:54:01,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-07 15:54:01,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9583a595/cf3c85ea13394b4586f88a02fba46a17/FLAG49d5b3abd [2019-10-07 15:54:01,843 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9583a595/cf3c85ea13394b4586f88a02fba46a17 [2019-10-07 15:54:01,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 15:54:01,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 15:54:01,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:01,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 15:54:01,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 15:54:01,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:01" (1/1) ... [2019-10-07 15:54:01,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170a06bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:01, skipping insertion in model container [2019-10-07 15:54:01,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 03:54:01" (1/1) ... [2019-10-07 15:54:01,875 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 15:54:01,937 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 15:54:02,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:02,412 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 15:54:02,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 15:54:02,508 INFO L192 MainTranslator]: Completed translation [2019-10-07 15:54:02,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:02 WrapperNode [2019-10-07 15:54:02,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 15:54:02,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 15:54:02,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 15:54:02,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 15:54:02,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:02" (1/1) ... [2019-10-07 15:54:02,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:02" (1/1) ... [2019-10-07 15:54:02,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:02" (1/1) ... [2019-10-07 15:54:02,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:02" (1/1) ... [2019-10-07 15:54:02,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:02" (1/1) ... [2019-10-07 15:54:02,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:02" (1/1) ... [2019-10-07 15:54:02,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:02" (1/1) ... [2019-10-07 15:54:02,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 15:54:02,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 15:54:02,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 15:54:02,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 15:54:02,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54: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-07 15:54:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 15:54:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 15:54:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-07 15:54:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-07 15:54:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-07 15:54:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-07 15:54:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-07 15:54:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-07 15:54:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-07 15:54:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-07 15:54:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-07 15:54:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-07 15:54:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-07 15:54:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-07 15:54:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-07 15:54:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-07 15:54:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-07 15:54:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 15:54:02,641 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-07 15:54:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 15:54:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-07 15:54:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-07 15:54:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-07 15:54:02,641 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-07 15:54:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-07 15:54:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 15:54:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-07 15:54:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-07 15:54:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-07 15:54:02,642 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-07 15:54:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-07 15:54:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-07 15:54:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-07 15:54:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-07 15:54:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-07 15:54:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-07 15:54:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-07 15:54:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-07 15:54:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-07 15:54:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-07 15:54:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-07 15:54:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 15:54:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 15:54:02,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 15:54:04,042 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 15:54:04,043 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 15:54:04,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:04 BoogieIcfgContainer [2019-10-07 15:54:04,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 15:54:04,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 15:54:04,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 15:54:04,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 15:54:04,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 03:54:01" (1/3) ... [2019-10-07 15:54:04,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b199bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:04, skipping insertion in model container [2019-10-07 15:54:04,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 03:54:02" (2/3) ... [2019-10-07 15:54:04,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b199bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 03:54:04, skipping insertion in model container [2019-10-07 15:54:04,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 03:54:04" (3/3) ... [2019-10-07 15:54:04,052 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-07 15:54:04,062 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 15:54:04,071 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 15:54:04,082 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 15:54:04,110 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 15:54:04,110 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 15:54:04,110 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 15:54:04,110 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 15:54:04,111 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 15:54:04,111 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 15:54:04,111 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 15:54:04,111 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 15:54:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2019-10-07 15:54:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-07 15:54:04,143 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:04,145 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:04,147 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:04,153 INFO L82 PathProgramCache]: Analyzing trace with hash -625438079, now seen corresponding path program 1 times [2019-10-07 15:54:04,162 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:04,162 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:04,163 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:04,163 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:04,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:04,711 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-07 15:54:04,711 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:04,712 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:04,713 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:04,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:04,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:04,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:04,734 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 4 states. [2019-10-07 15:54:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:04,891 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2019-10-07 15:54:04,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:04,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-07 15:54:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:04,914 INFO L225 Difference]: With dead ends: 355 [2019-10-07 15:54:04,914 INFO L226 Difference]: Without dead ends: 181 [2019-10-07 15:54:04,928 INFO L606 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-07 15:54:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-07 15:54:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-10-07 15:54:05,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-07 15:54:05,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 255 transitions. [2019-10-07 15:54:05,009 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 255 transitions. Word has length 44 [2019-10-07 15:54:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:05,009 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 255 transitions. [2019-10-07 15:54:05,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:05,010 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 255 transitions. [2019-10-07 15:54:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-07 15:54:05,013 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:05,014 INFO L385 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] [2019-10-07 15:54:05,014 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:05,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:05,015 INFO L82 PathProgramCache]: Analyzing trace with hash 478066743, now seen corresponding path program 1 times [2019-10-07 15:54:05,015 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:05,015 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:05,015 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:05,015 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:05,221 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-07 15:54:05,221 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:05,222 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:05,222 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:05,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:05,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:05,232 INFO L87 Difference]: Start difference. First operand 181 states and 255 transitions. Second operand 5 states. [2019-10-07 15:54:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:05,388 INFO L93 Difference]: Finished difference Result 693 states and 980 transitions. [2019-10-07 15:54:05,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 15:54:05,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-07 15:54:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:05,407 INFO L225 Difference]: With dead ends: 693 [2019-10-07 15:54:05,408 INFO L226 Difference]: Without dead ends: 503 [2019-10-07 15:54:05,411 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-10-07 15:54:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 359. [2019-10-07 15:54:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-10-07 15:54:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 506 transitions. [2019-10-07 15:54:05,515 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 506 transitions. Word has length 58 [2019-10-07 15:54:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:05,515 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 506 transitions. [2019-10-07 15:54:05,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 506 transitions. [2019-10-07 15:54:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 15:54:05,518 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:05,519 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:05,519 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:05,519 INFO L82 PathProgramCache]: Analyzing trace with hash -226555182, now seen corresponding path program 1 times [2019-10-07 15:54:05,521 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:05,521 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:05,522 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:05,522 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:05,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:05,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:05,614 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-07 15:54:05,615 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:05,615 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:05,615 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:05,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:05,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:05,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:05,617 INFO L87 Difference]: Start difference. First operand 359 states and 506 transitions. Second operand 4 states. [2019-10-07 15:54:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:05,678 INFO L93 Difference]: Finished difference Result 719 states and 1019 transitions. [2019-10-07 15:54:05,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:05,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-07 15:54:05,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:05,682 INFO L225 Difference]: With dead ends: 719 [2019-10-07 15:54:05,683 INFO L226 Difference]: Without dead ends: 369 [2019-10-07 15:54:05,685 INFO L606 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-07 15:54:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-10-07 15:54:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2019-10-07 15:54:05,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-10-07 15:54:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 514 transitions. [2019-10-07 15:54:05,713 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 514 transitions. Word has length 60 [2019-10-07 15:54:05,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:05,714 INFO L462 AbstractCegarLoop]: Abstraction has 369 states and 514 transitions. [2019-10-07 15:54:05,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 514 transitions. [2019-10-07 15:54:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-07 15:54:05,717 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:05,717 INFO L385 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] [2019-10-07 15:54:05,718 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:05,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash -922435534, now seen corresponding path program 1 times [2019-10-07 15:54:05,718 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:05,718 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:05,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:05,719 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:05,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:05,871 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-07 15:54:05,872 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:05,872 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:05,872 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:05,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:05,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:05,873 INFO L87 Difference]: Start difference. First operand 369 states and 514 transitions. Second operand 4 states. [2019-10-07 15:54:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:05,962 INFO L93 Difference]: Finished difference Result 739 states and 1041 transitions. [2019-10-07 15:54:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:05,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-07 15:54:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:05,967 INFO L225 Difference]: With dead ends: 739 [2019-10-07 15:54:05,967 INFO L226 Difference]: Without dead ends: 379 [2019-10-07 15:54:05,970 INFO L606 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-07 15:54:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-10-07 15:54:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2019-10-07 15:54:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-10-07 15:54:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 522 transitions. [2019-10-07 15:54:06,014 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 522 transitions. Word has length 68 [2019-10-07 15:54:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:06,015 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 522 transitions. [2019-10-07 15:54:06,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 522 transitions. [2019-10-07 15:54:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 15:54:06,023 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:06,023 INFO L385 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] [2019-10-07 15:54:06,024 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:06,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:06,024 INFO L82 PathProgramCache]: Analyzing trace with hash -215473092, now seen corresponding path program 1 times [2019-10-07 15:54:06,024 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:06,025 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:06,025 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:06,025 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:06,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:06,192 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-07 15:54:06,193 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:06,193 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:06,193 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:06,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:06,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:06,194 INFO L87 Difference]: Start difference. First operand 379 states and 522 transitions. Second operand 4 states. [2019-10-07 15:54:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:06,250 INFO L93 Difference]: Finished difference Result 757 states and 1049 transitions. [2019-10-07 15:54:06,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:06,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-07 15:54:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:06,254 INFO L225 Difference]: With dead ends: 757 [2019-10-07 15:54:06,255 INFO L226 Difference]: Without dead ends: 387 [2019-10-07 15:54:06,257 INFO L606 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-07 15:54:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-10-07 15:54:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2019-10-07 15:54:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-10-07 15:54:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 528 transitions. [2019-10-07 15:54:06,276 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 528 transitions. Word has length 76 [2019-10-07 15:54:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:06,277 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 528 transitions. [2019-10-07 15:54:06,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 528 transitions. [2019-10-07 15:54:06,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-07 15:54:06,279 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:06,279 INFO L385 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-07 15:54:06,279 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:06,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:06,279 INFO L82 PathProgramCache]: Analyzing trace with hash -91522216, now seen corresponding path program 1 times [2019-10-07 15:54:06,280 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:06,280 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:06,280 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:06,280 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:06,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:06,474 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-07 15:54:06,474 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:06,475 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:06,476 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:06,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:06,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:06,483 INFO L87 Difference]: Start difference. First operand 387 states and 528 transitions. Second operand 4 states. [2019-10-07 15:54:06,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:06,541 INFO L93 Difference]: Finished difference Result 775 states and 1069 transitions. [2019-10-07 15:54:06,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:06,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-07 15:54:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:06,545 INFO L225 Difference]: With dead ends: 775 [2019-10-07 15:54:06,545 INFO L226 Difference]: Without dead ends: 397 [2019-10-07 15:54:06,547 INFO L606 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-07 15:54:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-07 15:54:06,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-10-07 15:54:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-07 15:54:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 536 transitions. [2019-10-07 15:54:06,567 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 536 transitions. Word has length 76 [2019-10-07 15:54:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:06,568 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 536 transitions. [2019-10-07 15:54:06,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 536 transitions. [2019-10-07 15:54:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-07 15:54:06,570 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:06,570 INFO L385 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] [2019-10-07 15:54:06,570 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:06,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:06,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1911112284, now seen corresponding path program 1 times [2019-10-07 15:54:06,571 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:06,571 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:06,571 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:06,571 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:06,677 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-07 15:54:06,677 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:06,677 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:06,678 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:06,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:06,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:06,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:06,680 INFO L87 Difference]: Start difference. First operand 397 states and 536 transitions. Second operand 4 states. [2019-10-07 15:54:06,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:06,730 INFO L93 Difference]: Finished difference Result 797 states and 1083 transitions. [2019-10-07 15:54:06,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:06,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-07 15:54:06,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:06,737 INFO L225 Difference]: With dead ends: 797 [2019-10-07 15:54:06,737 INFO L226 Difference]: Without dead ends: 409 [2019-10-07 15:54:06,739 INFO L606 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-07 15:54:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-10-07 15:54:06,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2019-10-07 15:54:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2019-10-07 15:54:06,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 546 transitions. [2019-10-07 15:54:06,764 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 546 transitions. Word has length 84 [2019-10-07 15:54:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:06,765 INFO L462 AbstractCegarLoop]: Abstraction has 409 states and 546 transitions. [2019-10-07 15:54:06,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:06,765 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 546 transitions. [2019-10-07 15:54:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-07 15:54:06,773 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:06,774 INFO L385 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] [2019-10-07 15:54:06,774 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:06,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:06,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1631233981, now seen corresponding path program 1 times [2019-10-07 15:54:06,775 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:06,775 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:06,775 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:06,775 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:06,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:07,101 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-07 15:54:07,101 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:07,101 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:07,102 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:54:07,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:54:07,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:54:07,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:07,104 INFO L87 Difference]: Start difference. First operand 409 states and 546 transitions. Second operand 12 states. [2019-10-07 15:54:09,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:09,982 INFO L93 Difference]: Finished difference Result 1292 states and 1697 transitions. [2019-10-07 15:54:09,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 15:54:09,983 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-10-07 15:54:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:09,990 INFO L225 Difference]: With dead ends: 1292 [2019-10-07 15:54:09,990 INFO L226 Difference]: Without dead ends: 892 [2019-10-07 15:54:09,992 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-10-07 15:54:10,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 828. [2019-10-07 15:54:10,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-10-07 15:54:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1082 transitions. [2019-10-07 15:54:10,045 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1082 transitions. Word has length 89 [2019-10-07 15:54:10,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:10,047 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1082 transitions. [2019-10-07 15:54:10,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:54:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1082 transitions. [2019-10-07 15:54:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-07 15:54:10,049 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:10,050 INFO L385 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] [2019-10-07 15:54:10,050 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:10,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:10,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1764502076, now seen corresponding path program 1 times [2019-10-07 15:54:10,051 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:10,051 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:10,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:10,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:10,150 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-07 15:54:10,150 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:10,151 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:10,151 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:10,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:10,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:10,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:10,153 INFO L87 Difference]: Start difference. First operand 828 states and 1082 transitions. Second operand 4 states. [2019-10-07 15:54:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:10,221 INFO L93 Difference]: Finished difference Result 1528 states and 2003 transitions. [2019-10-07 15:54:10,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:10,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-07 15:54:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:10,228 INFO L225 Difference]: With dead ends: 1528 [2019-10-07 15:54:10,228 INFO L226 Difference]: Without dead ends: 836 [2019-10-07 15:54:10,231 INFO L606 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-07 15:54:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2019-10-07 15:54:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 836. [2019-10-07 15:54:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 836 states. [2019-10-07 15:54:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1078 transitions. [2019-10-07 15:54:10,280 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1078 transitions. Word has length 91 [2019-10-07 15:54:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:10,281 INFO L462 AbstractCegarLoop]: Abstraction has 836 states and 1078 transitions. [2019-10-07 15:54:10,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1078 transitions. [2019-10-07 15:54:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-07 15:54:10,289 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:10,289 INFO L385 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] [2019-10-07 15:54:10,289 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1961062905, now seen corresponding path program 1 times [2019-10-07 15:54:10,290 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:10,290 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:10,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:10,290 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:10,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 15:54:10,396 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:10,396 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:10,396 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:10,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:10,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:10,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:10,398 INFO L87 Difference]: Start difference. First operand 836 states and 1078 transitions. Second operand 4 states. [2019-10-07 15:54:10,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:10,454 INFO L93 Difference]: Finished difference Result 1494 states and 1929 transitions. [2019-10-07 15:54:10,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:10,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-07 15:54:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:10,462 INFO L225 Difference]: With dead ends: 1494 [2019-10-07 15:54:10,463 INFO L226 Difference]: Without dead ends: 828 [2019-10-07 15:54:10,466 INFO L606 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-07 15:54:10,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-10-07 15:54:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2019-10-07 15:54:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-10-07 15:54:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1054 transitions. [2019-10-07 15:54:10,522 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1054 transitions. Word has length 93 [2019-10-07 15:54:10,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:10,522 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1054 transitions. [2019-10-07 15:54:10,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1054 transitions. [2019-10-07 15:54:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 15:54:10,524 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:10,524 INFO L385 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] [2019-10-07 15:54:10,524 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:10,525 INFO L82 PathProgramCache]: Analyzing trace with hash 534163009, now seen corresponding path program 1 times [2019-10-07 15:54:10,525 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:10,525 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:10,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:10,525 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:10,714 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-07 15:54:10,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:10,714 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:10,715 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 15:54:10,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 15:54:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 15:54:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-07 15:54:10,716 INFO L87 Difference]: Start difference. First operand 828 states and 1054 transitions. Second operand 8 states. [2019-10-07 15:54:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:11,120 INFO L93 Difference]: Finished difference Result 1237 states and 1586 transitions. [2019-10-07 15:54:11,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 15:54:11,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-10-07 15:54:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:11,127 INFO L225 Difference]: With dead ends: 1237 [2019-10-07 15:54:11,128 INFO L226 Difference]: Without dead ends: 1235 [2019-10-07 15:54:11,129 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-07 15:54:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2019-10-07 15:54:11,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1168. [2019-10-07 15:54:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2019-10-07 15:54:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1484 transitions. [2019-10-07 15:54:11,184 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1484 transitions. Word has length 92 [2019-10-07 15:54:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:11,185 INFO L462 AbstractCegarLoop]: Abstraction has 1168 states and 1484 transitions. [2019-10-07 15:54:11,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 15:54:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1484 transitions. [2019-10-07 15:54:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-07 15:54:11,187 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:11,187 INFO L385 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] [2019-10-07 15:54:11,187 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:11,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1249614211, now seen corresponding path program 1 times [2019-10-07 15:54:11,188 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:11,188 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:11,188 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:11,188 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:11,291 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-07 15:54:11,291 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:11,292 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:11,292 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-07 15:54:11,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-07 15:54:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-07 15:54:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-07 15:54:11,293 INFO L87 Difference]: Start difference. First operand 1168 states and 1484 transitions. Second operand 7 states. [2019-10-07 15:54:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:11,383 INFO L93 Difference]: Finished difference Result 1217 states and 1562 transitions. [2019-10-07 15:54:11,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 15:54:11,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-10-07 15:54:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:11,392 INFO L225 Difference]: With dead ends: 1217 [2019-10-07 15:54:11,392 INFO L226 Difference]: Without dead ends: 1215 [2019-10-07 15:54:11,394 INFO L606 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-07 15:54:11,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-10-07 15:54:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 848. [2019-10-07 15:54:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-10-07 15:54:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1076 transitions. [2019-10-07 15:54:11,454 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1076 transitions. Word has length 92 [2019-10-07 15:54:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:11,455 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1076 transitions. [2019-10-07 15:54:11,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-07 15:54:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1076 transitions. [2019-10-07 15:54:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-07 15:54:11,456 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:11,457 INFO L385 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] [2019-10-07 15:54:11,457 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:11,457 INFO L82 PathProgramCache]: Analyzing trace with hash -371642591, now seen corresponding path program 1 times [2019-10-07 15:54:11,458 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:11,458 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:11,458 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:11,458 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:11,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 15:54:11,679 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:11,679 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:11,679 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-07 15:54:11,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-07 15:54:11,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-07 15:54:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-07 15:54:11,681 INFO L87 Difference]: Start difference. First operand 848 states and 1076 transitions. Second operand 12 states. [2019-10-07 15:54:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:14,990 INFO L93 Difference]: Finished difference Result 2444 states and 3060 transitions. [2019-10-07 15:54:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-07 15:54:14,990 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-10-07 15:54:14,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:15,001 INFO L225 Difference]: With dead ends: 2444 [2019-10-07 15:54:15,001 INFO L226 Difference]: Without dead ends: 1766 [2019-10-07 15:54:15,004 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-10-07 15:54:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1373. [2019-10-07 15:54:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1373 states. [2019-10-07 15:54:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1730 transitions. [2019-10-07 15:54:15,080 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1730 transitions. Word has length 97 [2019-10-07 15:54:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:15,080 INFO L462 AbstractCegarLoop]: Abstraction has 1373 states and 1730 transitions. [2019-10-07 15:54:15,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-07 15:54:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1730 transitions. [2019-10-07 15:54:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-07 15:54:15,082 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:15,083 INFO L385 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] [2019-10-07 15:54:15,083 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:15,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash -91002566, now seen corresponding path program 1 times [2019-10-07 15:54:15,084 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:15,084 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:15,084 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:15,084 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:15,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:15,151 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-07 15:54:15,152 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:15,152 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:15,152 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:15,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:15,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:15,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:15,153 INFO L87 Difference]: Start difference. First operand 1373 states and 1730 transitions. Second operand 5 states. [2019-10-07 15:54:15,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:15,644 INFO L93 Difference]: Finished difference Result 4907 states and 6257 transitions. [2019-10-07 15:54:15,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:15,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-07 15:54:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:15,671 INFO L225 Difference]: With dead ends: 4907 [2019-10-07 15:54:15,671 INFO L226 Difference]: Without dead ends: 3694 [2019-10-07 15:54:15,679 INFO L606 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-07 15:54:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-10-07 15:54:15,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3436. [2019-10-07 15:54:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2019-10-07 15:54:15,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 4348 transitions. [2019-10-07 15:54:15,919 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 4348 transitions. Word has length 98 [2019-10-07 15:54:15,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:15,920 INFO L462 AbstractCegarLoop]: Abstraction has 3436 states and 4348 transitions. [2019-10-07 15:54:15,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:15,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 4348 transitions. [2019-10-07 15:54:15,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-07 15:54:15,924 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:15,924 INFO L385 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] [2019-10-07 15:54:15,925 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:15,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1778951428, now seen corresponding path program 1 times [2019-10-07 15:54:15,926 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:15,926 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:15,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:15,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:15,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:16,229 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-07 15:54:16,229 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:16,230 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:16,230 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:16,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:16,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:16,231 INFO L87 Difference]: Start difference. First operand 3436 states and 4348 transitions. Second operand 9 states. [2019-10-07 15:54:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:17,434 INFO L93 Difference]: Finished difference Result 7473 states and 9491 transitions. [2019-10-07 15:54:17,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-07 15:54:17,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-10-07 15:54:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:17,462 INFO L225 Difference]: With dead ends: 7473 [2019-10-07 15:54:17,462 INFO L226 Difference]: Without dead ends: 4401 [2019-10-07 15:54:17,474 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-07 15:54:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2019-10-07 15:54:17,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 3986. [2019-10-07 15:54:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3986 states. [2019-10-07 15:54:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 5033 transitions. [2019-10-07 15:54:17,717 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 5033 transitions. Word has length 98 [2019-10-07 15:54:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:17,718 INFO L462 AbstractCegarLoop]: Abstraction has 3986 states and 5033 transitions. [2019-10-07 15:54:17,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:17,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 5033 transitions. [2019-10-07 15:54:17,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-07 15:54:17,723 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:17,723 INFO L385 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] [2019-10-07 15:54:17,724 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:17,724 INFO L82 PathProgramCache]: Analyzing trace with hash -693645360, now seen corresponding path program 1 times [2019-10-07 15:54:17,725 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:17,725 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:17,725 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:17,725 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:17,902 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-07 15:54:17,903 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:17,903 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:17,903 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:17,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:17,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:17,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:17,905 INFO L87 Difference]: Start difference. First operand 3986 states and 5033 transitions. Second operand 9 states. [2019-10-07 15:54:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:19,347 INFO L93 Difference]: Finished difference Result 7879 states and 10135 transitions. [2019-10-07 15:54:19,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 15:54:19,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-10-07 15:54:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:19,372 INFO L225 Difference]: With dead ends: 7879 [2019-10-07 15:54:19,373 INFO L226 Difference]: Without dead ends: 4293 [2019-10-07 15:54:19,384 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-10-07 15:54:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2019-10-07 15:54:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 3731. [2019-10-07 15:54:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3731 states. [2019-10-07 15:54:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4730 transitions. [2019-10-07 15:54:19,586 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4730 transitions. Word has length 100 [2019-10-07 15:54:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:19,587 INFO L462 AbstractCegarLoop]: Abstraction has 3731 states and 4730 transitions. [2019-10-07 15:54:19,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4730 transitions. [2019-10-07 15:54:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:19,589 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:19,589 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:19,590 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash 47221803, now seen corresponding path program 1 times [2019-10-07 15:54:19,590 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:19,590 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:19,591 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:19,591 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:19,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-07 15:54:19,693 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:19,693 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:19,694 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:19,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:19,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:19,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:19,695 INFO L87 Difference]: Start difference. First operand 3731 states and 4730 transitions. Second operand 4 states. [2019-10-07 15:54:19,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:19,888 INFO L93 Difference]: Finished difference Result 6991 states and 8932 transitions. [2019-10-07 15:54:19,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:19,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-07 15:54:19,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:19,907 INFO L225 Difference]: With dead ends: 6991 [2019-10-07 15:54:19,907 INFO L226 Difference]: Without dead ends: 3673 [2019-10-07 15:54:19,916 INFO L606 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-07 15:54:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3673 states. [2019-10-07 15:54:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3673 to 3673. [2019-10-07 15:54:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3673 states. [2019-10-07 15:54:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 4556 transitions. [2019-10-07 15:54:20,091 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 4556 transitions. Word has length 102 [2019-10-07 15:54:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:20,093 INFO L462 AbstractCegarLoop]: Abstraction has 3673 states and 4556 transitions. [2019-10-07 15:54:20,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 4556 transitions. [2019-10-07 15:54:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:20,096 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:20,096 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:20,097 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:20,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:20,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1122908653, now seen corresponding path program 1 times [2019-10-07 15:54:20,097 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:20,097 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:20,098 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:20,098 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:20,171 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-07 15:54:20,172 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:20,172 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:20,172 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:20,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:20,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:20,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:20,174 INFO L87 Difference]: Start difference. First operand 3673 states and 4556 transitions. Second operand 5 states. [2019-10-07 15:54:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:20,647 INFO L93 Difference]: Finished difference Result 11003 states and 13589 transitions. [2019-10-07 15:54:20,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:20,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-07 15:54:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:20,686 INFO L225 Difference]: With dead ends: 11003 [2019-10-07 15:54:20,687 INFO L226 Difference]: Without dead ends: 7835 [2019-10-07 15:54:20,698 INFO L606 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-07 15:54:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2019-10-07 15:54:21,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 6172. [2019-10-07 15:54:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6172 states. [2019-10-07 15:54:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6172 states to 6172 states and 7614 transitions. [2019-10-07 15:54:21,062 INFO L78 Accepts]: Start accepts. Automaton has 6172 states and 7614 transitions. Word has length 102 [2019-10-07 15:54:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:21,063 INFO L462 AbstractCegarLoop]: Abstraction has 6172 states and 7614 transitions. [2019-10-07 15:54:21,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 6172 states and 7614 transitions. [2019-10-07 15:54:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-07 15:54:21,067 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:21,067 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:21,067 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:21,068 INFO L82 PathProgramCache]: Analyzing trace with hash -311747556, now seen corresponding path program 1 times [2019-10-07 15:54:21,068 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:21,068 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,068 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,068 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:21,133 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-07 15:54:21,133 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:21,133 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:21,134 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 15:54:21,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 15:54:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 15:54:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:21,135 INFO L87 Difference]: Start difference. First operand 6172 states and 7614 transitions. Second operand 5 states. [2019-10-07 15:54:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:21,692 INFO L93 Difference]: Finished difference Result 14042 states and 17225 transitions. [2019-10-07 15:54:21,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-07 15:54:21,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-07 15:54:21,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:21,727 INFO L225 Difference]: With dead ends: 14042 [2019-10-07 15:54:21,727 INFO L226 Difference]: Without dead ends: 8565 [2019-10-07 15:54:21,744 INFO L606 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-07 15:54:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8565 states. [2019-10-07 15:54:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8565 to 8209. [2019-10-07 15:54:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8209 states. [2019-10-07 15:54:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8209 states to 8209 states and 10035 transitions. [2019-10-07 15:54:22,306 INFO L78 Accepts]: Start accepts. Automaton has 8209 states and 10035 transitions. Word has length 102 [2019-10-07 15:54:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:22,306 INFO L462 AbstractCegarLoop]: Abstraction has 8209 states and 10035 transitions. [2019-10-07 15:54:22,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 15:54:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 8209 states and 10035 transitions. [2019-10-07 15:54:22,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-07 15:54:22,315 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:22,316 INFO L385 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] [2019-10-07 15:54:22,316 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:22,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:22,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1621883247, now seen corresponding path program 1 times [2019-10-07 15:54:22,316 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:22,317 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:22,317 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:22,317 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:22,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:22,370 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-07 15:54:22,371 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:22,371 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:22,371 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 15:54:22,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 15:54:22,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 15:54:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 15:54:22,372 INFO L87 Difference]: Start difference. First operand 8209 states and 10035 transitions. Second operand 3 states. [2019-10-07 15:54:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:22,640 INFO L93 Difference]: Finished difference Result 15768 states and 19208 transitions. [2019-10-07 15:54:22,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 15:54:22,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-07 15:54:22,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:22,667 INFO L225 Difference]: With dead ends: 15768 [2019-10-07 15:54:22,667 INFO L226 Difference]: Without dead ends: 8248 [2019-10-07 15:54:22,687 INFO L606 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-07 15:54:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8248 states. [2019-10-07 15:54:23,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8248 to 8215. [2019-10-07 15:54:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8215 states. [2019-10-07 15:54:23,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8215 states to 8215 states and 10041 transitions. [2019-10-07 15:54:23,242 INFO L78 Accepts]: Start accepts. Automaton has 8215 states and 10041 transitions. Word has length 103 [2019-10-07 15:54:23,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:23,242 INFO L462 AbstractCegarLoop]: Abstraction has 8215 states and 10041 transitions. [2019-10-07 15:54:23,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 15:54:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 8215 states and 10041 transitions. [2019-10-07 15:54:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-07 15:54:23,249 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:23,249 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:23,250 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:23,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:23,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1474773640, now seen corresponding path program 1 times [2019-10-07 15:54:23,250 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:23,250 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:23,251 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:23,251 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:23,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:23,522 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-07 15:54:23,523 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:23,523 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:23,523 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 15:54:23,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 15:54:23,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 15:54:23,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-07 15:54:23,524 INFO L87 Difference]: Start difference. First operand 8215 states and 10041 transitions. Second operand 9 states. [2019-10-07 15:54:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:25,173 INFO L93 Difference]: Finished difference Result 15712 states and 19102 transitions. [2019-10-07 15:54:25,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-07 15:54:25,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-07 15:54:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:25,196 INFO L225 Difference]: With dead ends: 15712 [2019-10-07 15:54:25,197 INFO L226 Difference]: Without dead ends: 7677 [2019-10-07 15:54:25,215 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-07 15:54:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7677 states. [2019-10-07 15:54:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7677 to 6930. [2019-10-07 15:54:25,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6930 states. [2019-10-07 15:54:25,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6930 states to 6930 states and 8386 transitions. [2019-10-07 15:54:25,595 INFO L78 Accepts]: Start accepts. Automaton has 6930 states and 8386 transitions. Word has length 104 [2019-10-07 15:54:25,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:25,596 INFO L462 AbstractCegarLoop]: Abstraction has 6930 states and 8386 transitions. [2019-10-07 15:54:25,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 15:54:25,596 INFO L276 IsEmpty]: Start isEmpty. Operand 6930 states and 8386 transitions. [2019-10-07 15:54:25,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-07 15:54:25,599 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:25,599 INFO L385 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] [2019-10-07 15:54:25,599 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:25,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1828873027, now seen corresponding path program 1 times [2019-10-07 15:54:25,600 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:25,600 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,600 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,601 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:25,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:25,764 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-07 15:54:25,764 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:25,765 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:25,765 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-07 15:54:25,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-07 15:54:25,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-07 15:54:25,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-07 15:54:25,766 INFO L87 Difference]: Start difference. First operand 6930 states and 8386 transitions. Second operand 8 states. [2019-10-07 15:54:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:27,425 INFO L93 Difference]: Finished difference Result 13615 states and 16453 transitions. [2019-10-07 15:54:27,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-07 15:54:27,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-10-07 15:54:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:27,447 INFO L225 Difference]: With dead ends: 13615 [2019-10-07 15:54:27,447 INFO L226 Difference]: Without dead ends: 6974 [2019-10-07 15:54:27,459 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-07 15:54:27,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2019-10-07 15:54:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6772. [2019-10-07 15:54:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6772 states. [2019-10-07 15:54:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6772 states to 6772 states and 8178 transitions. [2019-10-07 15:54:27,789 INFO L78 Accepts]: Start accepts. Automaton has 6772 states and 8178 transitions. Word has length 105 [2019-10-07 15:54:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:27,790 INFO L462 AbstractCegarLoop]: Abstraction has 6772 states and 8178 transitions. [2019-10-07 15:54:27,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-07 15:54:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6772 states and 8178 transitions. [2019-10-07 15:54:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-07 15:54:27,792 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:27,792 INFO L385 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 15:54:27,793 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:27,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:27,793 INFO L82 PathProgramCache]: Analyzing trace with hash -653612548, now seen corresponding path program 1 times [2019-10-07 15:54:27,793 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:27,793 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:27,794 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:27,794 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:27,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:27,845 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-07 15:54:27,845 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:27,845 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:27,846 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:27,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:27,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:27,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:27,847 INFO L87 Difference]: Start difference. First operand 6772 states and 8178 transitions. Second operand 4 states. [2019-10-07 15:54:28,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:28,165 INFO L93 Difference]: Finished difference Result 13109 states and 15788 transitions. [2019-10-07 15:54:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:28,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-07 15:54:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:28,188 INFO L225 Difference]: With dead ends: 13109 [2019-10-07 15:54:28,188 INFO L226 Difference]: Without dead ends: 6626 [2019-10-07 15:54:28,200 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 15:54:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6626 states. [2019-10-07 15:54:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6626 to 6267. [2019-10-07 15:54:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6267 states. [2019-10-07 15:54:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6267 states to 6267 states and 7549 transitions. [2019-10-07 15:54:28,626 INFO L78 Accepts]: Start accepts. Automaton has 6267 states and 7549 transitions. Word has length 106 [2019-10-07 15:54:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:28,626 INFO L462 AbstractCegarLoop]: Abstraction has 6267 states and 7549 transitions. [2019-10-07 15:54:28,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 6267 states and 7549 transitions. [2019-10-07 15:54:28,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-07 15:54:28,628 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:28,629 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 15:54:28,629 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:28,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2135673103, now seen corresponding path program 1 times [2019-10-07 15:54:28,630 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:28,630 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:28,630 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:28,630 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-07 15:54:28,720 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:28,721 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:28,721 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:28,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:28,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:28,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:28,722 INFO L87 Difference]: Start difference. First operand 6267 states and 7549 transitions. Second operand 4 states. [2019-10-07 15:54:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:29,126 INFO L93 Difference]: Finished difference Result 12146 states and 14755 transitions. [2019-10-07 15:54:29,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:29,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-10-07 15:54:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:29,150 INFO L225 Difference]: With dead ends: 12146 [2019-10-07 15:54:29,150 INFO L226 Difference]: Without dead ends: 6147 [2019-10-07 15:54:29,164 INFO L606 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-07 15:54:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2019-10-07 15:54:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 5769. [2019-10-07 15:54:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5769 states. [2019-10-07 15:54:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5769 states to 5769 states and 6709 transitions. [2019-10-07 15:54:29,641 INFO L78 Accepts]: Start accepts. Automaton has 5769 states and 6709 transitions. Word has length 118 [2019-10-07 15:54:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:29,641 INFO L462 AbstractCegarLoop]: Abstraction has 5769 states and 6709 transitions. [2019-10-07 15:54:29,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5769 states and 6709 transitions. [2019-10-07 15:54:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-07 15:54:29,645 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:29,645 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 15:54:29,645 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:29,646 INFO L82 PathProgramCache]: Analyzing trace with hash -395511045, now seen corresponding path program 1 times [2019-10-07 15:54:29,646 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:29,646 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,646 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,646 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:29,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-07 15:54:29,738 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:29,738 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 15:54:29,738 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 15:54:29,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 15:54:29,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 15:54:29,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 15:54:29,739 INFO L87 Difference]: Start difference. First operand 5769 states and 6709 transitions. Second operand 4 states. [2019-10-07 15:54:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:30,069 INFO L93 Difference]: Finished difference Result 11112 states and 12961 transitions. [2019-10-07 15:54:30,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 15:54:30,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-07 15:54:30,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:30,084 INFO L225 Difference]: With dead ends: 11112 [2019-10-07 15:54:30,085 INFO L226 Difference]: Without dead ends: 5631 [2019-10-07 15:54:30,093 INFO L606 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-07 15:54:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-10-07 15:54:30,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5227. [2019-10-07 15:54:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5227 states. [2019-10-07 15:54:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 5900 transitions. [2019-10-07 15:54:30,372 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 5900 transitions. Word has length 134 [2019-10-07 15:54:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:30,374 INFO L462 AbstractCegarLoop]: Abstraction has 5227 states and 5900 transitions. [2019-10-07 15:54:30,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 15:54:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 5900 transitions. [2019-10-07 15:54:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-07 15:54:30,378 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:30,378 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 15:54:30,379 INFO L410 AbstractCegarLoop]: === Iteration 26 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:30,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:30,379 INFO L82 PathProgramCache]: Analyzing trace with hash 437841812, now seen corresponding path program 1 times [2019-10-07 15:54:30,379 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:30,379 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:30,379 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:30,380 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-07 15:54:30,537 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:30,537 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:30,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-07 15:54:30,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-07 15:54:30,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-07 15:54:31,372 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-07 15:54:31,372 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 9] total 27 [2019-10-07 15:54:31,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-07 15:54:31,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-07 15:54:31,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2019-10-07 15:54:31,373 INFO L87 Difference]: Start difference. First operand 5227 states and 5900 transitions. Second operand 11 states. [2019-10-07 15:54:33,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 15:54:33,002 INFO L93 Difference]: Finished difference Result 11715 states and 13141 transitions. [2019-10-07 15:54:33,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-07 15:54:33,003 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 146 [2019-10-07 15:54:33,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 15:54:33,037 INFO L225 Difference]: With dead ends: 11715 [2019-10-07 15:54:33,037 INFO L226 Difference]: Without dead ends: 6708 [2019-10-07 15:54:33,054 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 276 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-10-07 15:54:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2019-10-07 15:54:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 4926. [2019-10-07 15:54:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4926 states. [2019-10-07 15:54:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4926 states to 4926 states and 5490 transitions. [2019-10-07 15:54:33,422 INFO L78 Accepts]: Start accepts. Automaton has 4926 states and 5490 transitions. Word has length 146 [2019-10-07 15:54:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 15:54:33,423 INFO L462 AbstractCegarLoop]: Abstraction has 4926 states and 5490 transitions. [2019-10-07 15:54:33,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-07 15:54:33,423 INFO L276 IsEmpty]: Start isEmpty. Operand 4926 states and 5490 transitions. [2019-10-07 15:54:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-07 15:54:33,427 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 15:54:33,428 INFO L385 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 15:54:33,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:33,644 INFO L410 AbstractCegarLoop]: === Iteration 27 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 15:54:33,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 15:54:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash 735981604, now seen corresponding path program 1 times [2019-10-07 15:54:33,645 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 15:54:33,645 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:33,645 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:33,645 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 15:54:33,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 15:54:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-07 15:54:33,821 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 15:54:33,822 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 15:54:33,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 15:54:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 15:54:34,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-07 15:54:34,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 15:54:34,257 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-10-07 15:54:34,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-07 15:54:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-07 15:54:34,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 15:54:34,983 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-07 15:54:35,133 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-10-07 15:54:36,915 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 8191 disjunctions. This might take some time... [2019-10-07 15:54:41,619 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 8191 disjunctions.