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.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:22:28,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:22:28,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:22:28,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:22:28,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:22:28,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:22:28,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:22:28,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:22:28,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:22:28,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:22:28,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:22:28,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:22:28,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:22:28,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:22:28,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:22:28,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:22:28,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:22:28,507 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:22:28,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:22:28,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:22:28,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:22:28,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:22:28,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:22:28,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:22:28,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:22:28,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:22:28,528 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:22:28,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:22:28,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:22:28,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:22:28,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:22:28,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:22:28,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:22:28,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:22:28,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:22:28,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:22:28,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:22:28,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:22:28,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:22:28,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:22:28,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:22:28,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:22:28,566 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:22:28,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:22:28,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:22:28,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:22:28,570 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:22:28,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:22:28,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:22:28,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:22:28,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:22:28,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:22:28,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:22:28,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:22:28,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:22:28,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:22:28,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:22:28,573 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:22:28,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:22:28,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:22:28,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:22:28,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:22:28,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:22:28,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:28,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:22:28,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:22:28,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:22:28,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:22:28,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:22:28,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:22:28,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:22:28,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:22:28,946 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:22:28,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:22:28,953 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:22:28,954 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:22:28,955 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-13 23:22:29,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2970cd1/dbcb4678e9ef4147966785d193932f34/FLAG6f478e644 [2019-10-13 23:22:29,661 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:22:29,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-13 23:22:29,676 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2970cd1/dbcb4678e9ef4147966785d193932f34/FLAG6f478e644 [2019-10-13 23:22:29,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2970cd1/dbcb4678e9ef4147966785d193932f34 [2019-10-13 23:22:29,938 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:22:29,941 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:22:29,941 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:29,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:22:29,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:22:29,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:29" (1/1) ... [2019-10-13 23:22:29,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b371b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:29, skipping insertion in model container [2019-10-13 23:22:29,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:22:29" (1/1) ... [2019-10-13 23:22:29,955 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:22:30,005 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:22:30,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:30,383 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:22:30,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:22:30,497 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:22:30,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30 WrapperNode [2019-10-13 23:22:30,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:22:30,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:22:30,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:22:30,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:22:30,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... [2019-10-13 23:22:30,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:22:30,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:22:30,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:22:30,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:22:30,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:22:30,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:22:30,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:22:30,632 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-13 23:22:30,632 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-13 23:22:30,632 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-13 23:22:30,632 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-13 23:22:30,632 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-13 23:22:30,632 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-13 23:22:30,633 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-13 23:22:30,633 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-13 23:22:30,633 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 23:22:30,633 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-13 23:22:30,633 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-13 23:22:30,634 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-13 23:22:30,634 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-13 23:22:30,634 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-13 23:22:30,634 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 23:22:30,634 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:22:30,634 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 23:22:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:22:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:22:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:22:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:22:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:22:30,635 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:22:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:22:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-13 23:22:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-13 23:22:30,636 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-13 23:22:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-13 23:22:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-13 23:22:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-13 23:22:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-13 23:22:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-13 23:22:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:22:30,637 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-13 23:22:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-13 23:22:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-13 23:22:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-13 23:22:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-13 23:22:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:22:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:22:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:22:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:22:32,111 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:22:32,111 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 23:22:32,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:32 BoogieIcfgContainer [2019-10-13 23:22:32,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:22:32,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:22:32,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:22:32,117 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:22:32,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:22:29" (1/3) ... [2019-10-13 23:22:32,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2580a69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:32, skipping insertion in model container [2019-10-13 23:22:32,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:22:30" (2/3) ... [2019-10-13 23:22:32,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2580a69a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:22:32, skipping insertion in model container [2019-10-13 23:22:32,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:22:32" (3/3) ... [2019-10-13 23:22:32,122 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2019-10-13 23:22:32,136 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:22:32,147 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:22:32,162 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:22:32,196 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:22:32,196 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:22:32,197 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:22:32,197 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:22:32,197 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:22:32,198 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:22:32,198 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:22:32,198 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:22:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2019-10-13 23:22:32,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 23:22:32,236 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:32,238 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:32,240 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:32,247 INFO L82 PathProgramCache]: Analyzing trace with hash -696783202, now seen corresponding path program 1 times [2019-10-13 23:22:32,261 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:32,261 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997591756] [2019-10-13 23:22:32,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:32,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:32,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:32,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997591756] [2019-10-13 23:22:32,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:32,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:32,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281490204] [2019-10-13 23:22:32,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:32,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:32,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:32,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:32,830 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 4 states. [2019-10-13 23:22:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:32,991 INFO L93 Difference]: Finished difference Result 350 states and 532 transitions. [2019-10-13 23:22:32,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:32,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-10-13 23:22:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:33,007 INFO L225 Difference]: With dead ends: 350 [2019-10-13 23:22:33,007 INFO L226 Difference]: Without dead ends: 180 [2019-10-13 23:22:33,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-13 23:22:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-10-13 23:22:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-13 23:22:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 254 transitions. [2019-10-13 23:22:33,083 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 254 transitions. Word has length 44 [2019-10-13 23:22:33,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:33,084 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 254 transitions. [2019-10-13 23:22:33,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 254 transitions. [2019-10-13 23:22:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:33,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:33,088 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:33,088 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash 942948947, now seen corresponding path program 1 times [2019-10-13 23:22:33,089 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:33,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476275918] [2019-10-13 23:22:33,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:33,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476275918] [2019-10-13 23:22:33,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:33,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:33,273 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82692373] [2019-10-13 23:22:33,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:33,279 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:33,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:33,280 INFO L87 Difference]: Start difference. First operand 180 states and 254 transitions. Second operand 5 states. [2019-10-13 23:22:33,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:33,481 INFO L93 Difference]: Finished difference Result 689 states and 976 transitions. [2019-10-13 23:22:33,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:33,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-13 23:22:33,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:33,491 INFO L225 Difference]: With dead ends: 689 [2019-10-13 23:22:33,491 INFO L226 Difference]: Without dead ends: 500 [2019-10-13 23:22:33,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-10-13 23:22:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 357. [2019-10-13 23:22:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-10-13 23:22:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 504 transitions. [2019-10-13 23:22:33,556 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 504 transitions. Word has length 58 [2019-10-13 23:22:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:33,589 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 504 transitions. [2019-10-13 23:22:33,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 504 transitions. [2019-10-13 23:22:33,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 23:22:33,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:33,592 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:33,593 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:33,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:33,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1685484368, now seen corresponding path program 1 times [2019-10-13 23:22:33,594 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:33,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371586306] [2019-10-13 23:22:33,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,594 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:33,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371586306] [2019-10-13 23:22:33,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:33,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:33,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197914644] [2019-10-13 23:22:33,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:33,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:33,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:33,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:33,761 INFO L87 Difference]: Start difference. First operand 357 states and 504 transitions. Second operand 4 states. [2019-10-13 23:22:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:33,812 INFO L93 Difference]: Finished difference Result 715 states and 1015 transitions. [2019-10-13 23:22:33,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:33,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-10-13 23:22:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:33,817 INFO L225 Difference]: With dead ends: 715 [2019-10-13 23:22:33,817 INFO L226 Difference]: Without dead ends: 367 [2019-10-13 23:22:33,819 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-10-13 23:22:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2019-10-13 23:22:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 23:22:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 512 transitions. [2019-10-13 23:22:33,867 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 512 transitions. Word has length 60 [2019-10-13 23:22:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:33,870 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 512 transitions. [2019-10-13 23:22:33,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:33,870 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 512 transitions. [2019-10-13 23:22:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-13 23:22:33,880 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:33,881 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:33,881 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:33,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:33,884 INFO L82 PathProgramCache]: Analyzing trace with hash 952873872, now seen corresponding path program 1 times [2019-10-13 23:22:33,884 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:33,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198106749] [2019-10-13 23:22:33,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:33,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:34,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198106749] [2019-10-13 23:22:34,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:34,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622826909] [2019-10-13 23:22:34,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:34,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:34,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:34,045 INFO L87 Difference]: Start difference. First operand 367 states and 512 transitions. Second operand 4 states. [2019-10-13 23:22:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:34,121 INFO L93 Difference]: Finished difference Result 735 states and 1037 transitions. [2019-10-13 23:22:34,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:34,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-10-13 23:22:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:34,126 INFO L225 Difference]: With dead ends: 735 [2019-10-13 23:22:34,126 INFO L226 Difference]: Without dead ends: 377 [2019-10-13 23:22:34,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-10-13 23:22:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-10-13 23:22:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-10-13 23:22:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 520 transitions. [2019-10-13 23:22:34,155 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 520 transitions. Word has length 68 [2019-10-13 23:22:34,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:34,155 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 520 transitions. [2019-10-13 23:22:34,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 520 transitions. [2019-10-13 23:22:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 23:22:34,157 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,158 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:34,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash 81922330, now seen corresponding path program 1 times [2019-10-13 23:22:34,159 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401284867] [2019-10-13 23:22:34,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:34,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401284867] [2019-10-13 23:22:34,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:34,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966988018] [2019-10-13 23:22:34,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:34,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:34,321 INFO L87 Difference]: Start difference. First operand 377 states and 520 transitions. Second operand 4 states. [2019-10-13 23:22:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:34,382 INFO L93 Difference]: Finished difference Result 753 states and 1045 transitions. [2019-10-13 23:22:34,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:34,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-13 23:22:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:34,388 INFO L225 Difference]: With dead ends: 753 [2019-10-13 23:22:34,388 INFO L226 Difference]: Without dead ends: 385 [2019-10-13 23:22:34,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:34,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-10-13 23:22:34,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2019-10-13 23:22:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-10-13 23:22:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 526 transitions. [2019-10-13 23:22:34,427 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 526 transitions. Word has length 76 [2019-10-13 23:22:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:34,429 INFO L462 AbstractCegarLoop]: Abstraction has 385 states and 526 transitions. [2019-10-13 23:22:34,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 526 transitions. [2019-10-13 23:22:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 23:22:34,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,436 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:34,437 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,437 INFO L82 PathProgramCache]: Analyzing trace with hash 205873206, now seen corresponding path program 1 times [2019-10-13 23:22:34,438 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,438 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204401410] [2019-10-13 23:22:34,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,446 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:34,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204401410] [2019-10-13 23:22:34,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:34,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531077990] [2019-10-13 23:22:34,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:34,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:34,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:34,591 INFO L87 Difference]: Start difference. First operand 385 states and 526 transitions. Second operand 4 states. [2019-10-13 23:22:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:34,659 INFO L93 Difference]: Finished difference Result 771 states and 1065 transitions. [2019-10-13 23:22:34,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:34,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-13 23:22:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:34,665 INFO L225 Difference]: With dead ends: 771 [2019-10-13 23:22:34,666 INFO L226 Difference]: Without dead ends: 395 [2019-10-13 23:22:34,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-10-13 23:22:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2019-10-13 23:22:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2019-10-13 23:22:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 534 transitions. [2019-10-13 23:22:34,696 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 534 transitions. Word has length 76 [2019-10-13 23:22:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:34,698 INFO L462 AbstractCegarLoop]: Abstraction has 395 states and 534 transitions. [2019-10-13 23:22:34,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 534 transitions. [2019-10-13 23:22:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-13 23:22:34,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,700 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:34,701 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1572038470, now seen corresponding path program 1 times [2019-10-13 23:22:34,701 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,702 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245180875] [2019-10-13 23:22:34,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,702 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 23:22:34,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245180875] [2019-10-13 23:22:34,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:34,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:34,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627175919] [2019-10-13 23:22:34,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:34,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:34,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:34,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:34,857 INFO L87 Difference]: Start difference. First operand 395 states and 534 transitions. Second operand 4 states. [2019-10-13 23:22:34,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:34,914 INFO L93 Difference]: Finished difference Result 793 states and 1079 transitions. [2019-10-13 23:22:34,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:34,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-10-13 23:22:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:34,918 INFO L225 Difference]: With dead ends: 793 [2019-10-13 23:22:34,918 INFO L226 Difference]: Without dead ends: 407 [2019-10-13 23:22:34,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-10-13 23:22:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2019-10-13 23:22:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-13 23:22:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2019-10-13 23:22:34,942 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 84 [2019-10-13 23:22:34,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:34,942 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2019-10-13 23:22:34,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2019-10-13 23:22:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 23:22:34,944 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:34,945 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:34,945 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:34,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:34,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1474569183, now seen corresponding path program 1 times [2019-10-13 23:22:34,946 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:34,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401518770] [2019-10-13 23:22:34,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:34,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:35,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 23:22:35,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401518770] [2019-10-13 23:22:35,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:35,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:22:35,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643692360] [2019-10-13 23:22:35,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:22:35,175 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:35,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:22:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:35,176 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand 12 states. [2019-10-13 23:22:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:38,235 INFO L93 Difference]: Finished difference Result 1284 states and 1689 transitions. [2019-10-13 23:22:38,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:22:38,236 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 89 [2019-10-13 23:22:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:38,242 INFO L225 Difference]: With dead ends: 1284 [2019-10-13 23:22:38,242 INFO L226 Difference]: Without dead ends: 886 [2019-10-13 23:22:38,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-10-13 23:22:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 826. [2019-10-13 23:22:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-10-13 23:22:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1080 transitions. [2019-10-13 23:22:38,288 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1080 transitions. Word has length 89 [2019-10-13 23:22:38,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,289 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1080 transitions. [2019-10-13 23:22:38,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:22:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1080 transitions. [2019-10-13 23:22:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 23:22:38,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,291 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:38,291 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1411945989, now seen corresponding path program 1 times [2019-10-13 23:22:38,292 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506960138] [2019-10-13 23:22:38,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 23:22:38,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506960138] [2019-10-13 23:22:38,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:38,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:38,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694310769] [2019-10-13 23:22:38,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:38,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:38,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:38,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:38,394 INFO L87 Difference]: Start difference. First operand 826 states and 1080 transitions. Second operand 4 states. [2019-10-13 23:22:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:38,471 INFO L93 Difference]: Finished difference Result 1524 states and 1999 transitions. [2019-10-13 23:22:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:38,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 23:22:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:38,478 INFO L225 Difference]: With dead ends: 1524 [2019-10-13 23:22:38,478 INFO L226 Difference]: Without dead ends: 834 [2019-10-13 23:22:38,482 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2019-10-13 23:22:38,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2019-10-13 23:22:38,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-10-13 23:22:38,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1076 transitions. [2019-10-13 23:22:38,529 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1076 transitions. Word has length 91 [2019-10-13 23:22:38,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,530 INFO L462 AbstractCegarLoop]: Abstraction has 834 states and 1076 transitions. [2019-10-13 23:22:38,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:38,530 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1076 transitions. [2019-10-13 23:22:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 23:22:38,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,532 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:38,532 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,533 INFO L82 PathProgramCache]: Analyzing trace with hash -829194726, now seen corresponding path program 1 times [2019-10-13 23:22:38,533 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702675341] [2019-10-13 23:22:38,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:22:38,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702675341] [2019-10-13 23:22:38,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:38,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:38,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861608304] [2019-10-13 23:22:38,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:38,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:38,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:38,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:38,637 INFO L87 Difference]: Start difference. First operand 834 states and 1076 transitions. Second operand 4 states. [2019-10-13 23:22:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:38,692 INFO L93 Difference]: Finished difference Result 1490 states and 1925 transitions. [2019-10-13 23:22:38,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:38,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-10-13 23:22:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:38,698 INFO L225 Difference]: With dead ends: 1490 [2019-10-13 23:22:38,699 INFO L226 Difference]: Without dead ends: 826 [2019-10-13 23:22:38,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2019-10-13 23:22:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2019-10-13 23:22:38,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-10-13 23:22:38,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1052 transitions. [2019-10-13 23:22:38,747 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1052 transitions. Word has length 93 [2019-10-13 23:22:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:38,748 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1052 transitions. [2019-10-13 23:22:38,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1052 transitions. [2019-10-13 23:22:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 23:22:38,750 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:38,750 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:38,750 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:38,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash 220728736, now seen corresponding path program 1 times [2019-10-13 23:22:38,751 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:38,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320457689] [2019-10-13 23:22:38,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:38,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:22:38,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320457689] [2019-10-13 23:22:38,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:38,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:38,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942343527] [2019-10-13 23:22:38,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:38,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:38,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:38,951 INFO L87 Difference]: Start difference. First operand 826 states and 1052 transitions. Second operand 9 states. [2019-10-13 23:22:39,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:39,058 INFO L93 Difference]: Finished difference Result 884 states and 1136 transitions. [2019-10-13 23:22:39,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 23:22:39,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-13 23:22:39,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:39,066 INFO L225 Difference]: With dead ends: 884 [2019-10-13 23:22:39,066 INFO L226 Difference]: Without dead ends: 882 [2019-10-13 23:22:39,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:22:39,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2019-10-13 23:22:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 846. [2019-10-13 23:22:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-10-13 23:22:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1074 transitions. [2019-10-13 23:22:39,119 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1074 transitions. Word has length 92 [2019-10-13 23:22:39,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:39,120 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1074 transitions. [2019-10-13 23:22:39,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1074 transitions. [2019-10-13 23:22:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 23:22:39,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:39,122 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:39,122 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:39,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1901963715, now seen corresponding path program 1 times [2019-10-13 23:22:39,123 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:39,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810348472] [2019-10-13 23:22:39,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:39,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:39,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 23:22:39,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810348472] [2019-10-13 23:22:39,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:39,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:22:39,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279096480] [2019-10-13 23:22:39,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:22:39,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:39,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:22:39,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:22:39,419 INFO L87 Difference]: Start difference. First operand 846 states and 1074 transitions. Second operand 12 states. [2019-10-13 23:22:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:42,620 INFO L93 Difference]: Finished difference Result 2436 states and 3052 transitions. [2019-10-13 23:22:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 23:22:42,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-10-13 23:22:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:42,629 INFO L225 Difference]: With dead ends: 2436 [2019-10-13 23:22:42,629 INFO L226 Difference]: Without dead ends: 1760 [2019-10-13 23:22:42,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2019-10-13 23:22:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1371. [2019-10-13 23:22:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1371 states. [2019-10-13 23:22:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1728 transitions. [2019-10-13 23:22:42,717 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1728 transitions. Word has length 97 [2019-10-13 23:22:42,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:42,720 INFO L462 AbstractCegarLoop]: Abstraction has 1371 states and 1728 transitions. [2019-10-13 23:22:42,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:22:42,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1728 transitions. [2019-10-13 23:22:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 23:22:42,723 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:42,723 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:42,723 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1643610553, now seen corresponding path program 1 times [2019-10-13 23:22:42,724 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:42,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633453808] [2019-10-13 23:22:42,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:42,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:42,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:42,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633453808] [2019-10-13 23:22:42,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:42,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:42,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660971969] [2019-10-13 23:22:42,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:42,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:42,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:42,871 INFO L87 Difference]: Start difference. First operand 1371 states and 1728 transitions. Second operand 5 states. [2019-10-13 23:22:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:43,308 INFO L93 Difference]: Finished difference Result 4899 states and 6249 transitions. [2019-10-13 23:22:43,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:43,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-13 23:22:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:43,340 INFO L225 Difference]: With dead ends: 4899 [2019-10-13 23:22:43,340 INFO L226 Difference]: Without dead ends: 3688 [2019-10-13 23:22:43,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2019-10-13 23:22:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3432. [2019-10-13 23:22:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3432 states. [2019-10-13 23:22:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4344 transitions. [2019-10-13 23:22:43,537 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4344 transitions. Word has length 98 [2019-10-13 23:22:43,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:43,538 INFO L462 AbstractCegarLoop]: Abstraction has 3432 states and 4344 transitions. [2019-10-13 23:22:43,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:43,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4344 transitions. [2019-10-13 23:22:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 23:22:43,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:43,541 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:43,541 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:43,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2019998169, now seen corresponding path program 1 times [2019-10-13 23:22:43,542 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:43,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680701754] [2019-10-13 23:22:43,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:43,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:22:43,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680701754] [2019-10-13 23:22:43,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:43,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:43,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010471499] [2019-10-13 23:22:43,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:43,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:43,787 INFO L87 Difference]: Start difference. First operand 3432 states and 4344 transitions. Second operand 9 states. [2019-10-13 23:22:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:45,074 INFO L93 Difference]: Finished difference Result 7463 states and 9481 transitions. [2019-10-13 23:22:45,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:45,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-10-13 23:22:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:45,109 INFO L225 Difference]: With dead ends: 7463 [2019-10-13 23:22:45,110 INFO L226 Difference]: Without dead ends: 4395 [2019-10-13 23:22:45,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-13 23:22:45,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4395 states. [2019-10-13 23:22:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4395 to 3982. [2019-10-13 23:22:45,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3982 states. [2019-10-13 23:22:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3982 states to 3982 states and 5029 transitions. [2019-10-13 23:22:45,374 INFO L78 Accepts]: Start accepts. Automaton has 3982 states and 5029 transitions. Word has length 98 [2019-10-13 23:22:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:45,375 INFO L462 AbstractCegarLoop]: Abstraction has 3982 states and 5029 transitions. [2019-10-13 23:22:45,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 3982 states and 5029 transitions. [2019-10-13 23:22:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 23:22:45,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:45,378 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:45,379 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:45,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:45,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1064329041, now seen corresponding path program 1 times [2019-10-13 23:22:45,379 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:45,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367318765] [2019-10-13 23:22:45,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:45,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 23:22:45,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367318765] [2019-10-13 23:22:45,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:45,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:45,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775063486] [2019-10-13 23:22:45,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:45,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:45,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:45,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:45,603 INFO L87 Difference]: Start difference. First operand 3982 states and 5029 transitions. Second operand 9 states. [2019-10-13 23:22:47,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:47,243 INFO L93 Difference]: Finished difference Result 7870 states and 10126 transitions. [2019-10-13 23:22:47,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:22:47,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-10-13 23:22:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:47,270 INFO L225 Difference]: With dead ends: 7870 [2019-10-13 23:22:47,271 INFO L226 Difference]: Without dead ends: 4288 [2019-10-13 23:22:47,285 INFO L600 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-13 23:22:47,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-10-13 23:22:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 3727. [2019-10-13 23:22:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3727 states. [2019-10-13 23:22:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3727 states to 3727 states and 4726 transitions. [2019-10-13 23:22:47,564 INFO L78 Accepts]: Start accepts. Automaton has 3727 states and 4726 transitions. Word has length 100 [2019-10-13 23:22:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:47,564 INFO L462 AbstractCegarLoop]: Abstraction has 3727 states and 4726 transitions. [2019-10-13 23:22:47,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3727 states and 4726 transitions. [2019-10-13 23:22:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:47,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:47,568 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:47,568 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:47,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 966351914, now seen corresponding path program 1 times [2019-10-13 23:22:47,569 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:47,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12111130] [2019-10-13 23:22:47,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:47,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:47,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-13 23:22:47,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12111130] [2019-10-13 23:22:47,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:47,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:47,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679273458] [2019-10-13 23:22:47,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:47,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:47,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:47,669 INFO L87 Difference]: Start difference. First operand 3727 states and 4726 transitions. Second operand 4 states. [2019-10-13 23:22:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:47,807 INFO L93 Difference]: Finished difference Result 6983 states and 8924 transitions. [2019-10-13 23:22:47,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:47,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-10-13 23:22:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:47,829 INFO L225 Difference]: With dead ends: 6983 [2019-10-13 23:22:47,829 INFO L226 Difference]: Without dead ends: 3669 [2019-10-13 23:22:47,840 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:47,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-10-13 23:22:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 3669. [2019-10-13 23:22:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3669 states. [2019-10-13 23:22:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 4552 transitions. [2019-10-13 23:22:48,006 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 4552 transitions. Word has length 102 [2019-10-13 23:22:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:48,006 INFO L462 AbstractCegarLoop]: Abstraction has 3669 states and 4552 transitions. [2019-10-13 23:22:48,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 4552 transitions. [2019-10-13 23:22:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:48,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:48,009 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:48,010 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:48,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1813031188, now seen corresponding path program 1 times [2019-10-13 23:22:48,010 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:48,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63711506] [2019-10-13 23:22:48,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:48,011 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:48,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:48,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63711506] [2019-10-13 23:22:48,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:48,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:48,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289162677] [2019-10-13 23:22:48,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:48,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:48,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:48,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:48,082 INFO L87 Difference]: Start difference. First operand 3669 states and 4552 transitions. Second operand 5 states. [2019-10-13 23:22:48,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:48,648 INFO L93 Difference]: Finished difference Result 10987 states and 13573 transitions. [2019-10-13 23:22:48,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:48,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 23:22:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:48,689 INFO L225 Difference]: With dead ends: 10987 [2019-10-13 23:22:48,689 INFO L226 Difference]: Without dead ends: 7823 [2019-10-13 23:22:48,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:48,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2019-10-13 23:22:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 6168. [2019-10-13 23:22:49,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6168 states. [2019-10-13 23:22:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6168 states to 6168 states and 7610 transitions. [2019-10-13 23:22:49,032 INFO L78 Accepts]: Start accepts. Automaton has 6168 states and 7610 transitions. Word has length 102 [2019-10-13 23:22:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:49,032 INFO L462 AbstractCegarLoop]: Abstraction has 6168 states and 7610 transitions. [2019-10-13 23:22:49,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 6168 states and 7610 transitions. [2019-10-13 23:22:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 23:22:49,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:49,037 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:49,037 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1205195067, now seen corresponding path program 1 times [2019-10-13 23:22:49,038 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:49,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633949439] [2019-10-13 23:22:49,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:49,038 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:49,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:49,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633949439] [2019-10-13 23:22:49,115 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:49,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:49,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136607406] [2019-10-13 23:22:49,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:49,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:49,117 INFO L87 Difference]: Start difference. First operand 6168 states and 7610 transitions. Second operand 5 states. [2019-10-13 23:22:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:49,884 INFO L93 Difference]: Finished difference Result 14029 states and 17212 transitions. [2019-10-13 23:22:49,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:22:49,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 23:22:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:49,931 INFO L225 Difference]: With dead ends: 14029 [2019-10-13 23:22:49,931 INFO L226 Difference]: Without dead ends: 8556 [2019-10-13 23:22:49,948 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8556 states. [2019-10-13 23:22:50,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8556 to 8204. [2019-10-13 23:22:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8204 states. [2019-10-13 23:22:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8204 states to 8204 states and 10030 transitions. [2019-10-13 23:22:50,373 INFO L78 Accepts]: Start accepts. Automaton has 8204 states and 10030 transitions. Word has length 102 [2019-10-13 23:22:50,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:50,373 INFO L462 AbstractCegarLoop]: Abstraction has 8204 states and 10030 transitions. [2019-10-13 23:22:50,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:22:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8204 states and 10030 transitions. [2019-10-13 23:22:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 23:22:50,379 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:50,379 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:50,379 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:50,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1595637516, now seen corresponding path program 1 times [2019-10-13 23:22:50,380 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:50,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465952925] [2019-10-13 23:22:50,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:50,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:50,434 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465952925] [2019-10-13 23:22:50,434 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:50,434 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:50,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672054036] [2019-10-13 23:22:50,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:50,435 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:50,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:50,436 INFO L87 Difference]: Start difference. First operand 8204 states and 10030 transitions. Second operand 3 states. [2019-10-13 23:22:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:50,796 INFO L93 Difference]: Finished difference Result 15758 states and 19198 transitions. [2019-10-13 23:22:50,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:50,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-13 23:22:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:50,825 INFO L225 Difference]: With dead ends: 15758 [2019-10-13 23:22:50,825 INFO L226 Difference]: Without dead ends: 8243 [2019-10-13 23:22:50,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8243 states. [2019-10-13 23:22:51,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8243 to 8210. [2019-10-13 23:22:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8210 states. [2019-10-13 23:22:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8210 states to 8210 states and 10036 transitions. [2019-10-13 23:22:51,189 INFO L78 Accepts]: Start accepts. Automaton has 8210 states and 10036 transitions. Word has length 103 [2019-10-13 23:22:51,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:51,189 INFO L462 AbstractCegarLoop]: Abstraction has 8210 states and 10036 transitions. [2019-10-13 23:22:51,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 8210 states and 10036 transitions. [2019-10-13 23:22:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 23:22:51,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:51,194 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:51,194 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:51,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:51,195 INFO L82 PathProgramCache]: Analyzing trace with hash -573406473, now seen corresponding path program 1 times [2019-10-13 23:22:51,195 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:51,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510865061] [2019-10-13 23:22:51,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:51,195 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:51,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:51,373 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510865061] [2019-10-13 23:22:51,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:51,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:51,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462633912] [2019-10-13 23:22:51,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:51,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:51,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:51,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:51,375 INFO L87 Difference]: Start difference. First operand 8210 states and 10036 transitions. Second operand 9 states. [2019-10-13 23:22:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:53,128 INFO L93 Difference]: Finished difference Result 15702 states and 19092 transitions. [2019-10-13 23:22:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:22:53,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2019-10-13 23:22:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:53,157 INFO L225 Difference]: With dead ends: 15702 [2019-10-13 23:22:53,157 INFO L226 Difference]: Without dead ends: 7672 [2019-10-13 23:22:53,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:22:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7672 states. [2019-10-13 23:22:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7672 to 6925. [2019-10-13 23:22:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6925 states. [2019-10-13 23:22:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6925 states to 6925 states and 8381 transitions. [2019-10-13 23:22:53,565 INFO L78 Accepts]: Start accepts. Automaton has 6925 states and 8381 transitions. Word has length 104 [2019-10-13 23:22:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:53,565 INFO L462 AbstractCegarLoop]: Abstraction has 6925 states and 8381 transitions. [2019-10-13 23:22:53,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 6925 states and 8381 transitions. [2019-10-13 23:22:53,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 23:22:53,569 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:53,570 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:53,570 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:53,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash 789902915, now seen corresponding path program 1 times [2019-10-13 23:22:53,570 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:53,571 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628150400] [2019-10-13 23:22:53,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:53,571 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:53,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 23:22:53,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628150400] [2019-10-13 23:22:53,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:53,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 23:22:53,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019298377] [2019-10-13 23:22:53,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 23:22:53,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:53,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 23:22:53,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:22:53,786 INFO L87 Difference]: Start difference. First operand 6925 states and 8381 transitions. Second operand 8 states. [2019-10-13 23:22:55,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:55,259 INFO L93 Difference]: Finished difference Result 13563 states and 16384 transitions. [2019-10-13 23:22:55,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:55,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2019-10-13 23:22:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:55,287 INFO L225 Difference]: With dead ends: 13563 [2019-10-13 23:22:55,287 INFO L226 Difference]: Without dead ends: 6765 [2019-10-13 23:22:55,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:22:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6765 states. [2019-10-13 23:22:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6765 to 6262. [2019-10-13 23:22:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6262 states. [2019-10-13 23:22:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6262 states to 6262 states and 7546 transitions. [2019-10-13 23:22:55,715 INFO L78 Accepts]: Start accepts. Automaton has 6262 states and 7546 transitions. Word has length 105 [2019-10-13 23:22:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:55,716 INFO L462 AbstractCegarLoop]: Abstraction has 6262 states and 7546 transitions. [2019-10-13 23:22:55,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 23:22:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6262 states and 7546 transitions. [2019-10-13 23:22:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 23:22:55,718 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:55,719 INFO L380 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-13 23:22:55,719 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:55,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash 196478960, now seen corresponding path program 1 times [2019-10-13 23:22:55,719 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:55,720 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992278383] [2019-10-13 23:22:55,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:55,720 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:55,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:55,818 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-13 23:22:55,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992278383] [2019-10-13 23:22:55,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:55,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:55,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126627350] [2019-10-13 23:22:55,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:55,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:55,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:55,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:55,821 INFO L87 Difference]: Start difference. First operand 6262 states and 7546 transitions. Second operand 4 states. [2019-10-13 23:22:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:56,135 INFO L93 Difference]: Finished difference Result 12140 states and 14755 transitions. [2019-10-13 23:22:56,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:56,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-10-13 23:22:56,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:56,158 INFO L225 Difference]: With dead ends: 12140 [2019-10-13 23:22:56,159 INFO L226 Difference]: Without dead ends: 6142 [2019-10-13 23:22:56,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6142 states. [2019-10-13 23:22:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6142 to 5764. [2019-10-13 23:22:56,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5764 states. [2019-10-13 23:22:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5764 states to 5764 states and 6706 transitions. [2019-10-13 23:22:56,509 INFO L78 Accepts]: Start accepts. Automaton has 5764 states and 6706 transitions. Word has length 118 [2019-10-13 23:22:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:56,510 INFO L462 AbstractCegarLoop]: Abstraction has 5764 states and 6706 transitions. [2019-10-13 23:22:56,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:56,510 INFO L276 IsEmpty]: Start isEmpty. Operand 5764 states and 6706 transitions. [2019-10-13 23:22:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 23:22:56,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:56,514 INFO L380 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-13 23:22:56,514 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:56,514 INFO L82 PathProgramCache]: Analyzing trace with hash -544879366, now seen corresponding path program 1 times [2019-10-13 23:22:56,514 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:56,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182016519] [2019-10-13 23:22:56,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:56,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:56,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:56,618 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-13 23:22:56,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182016519] [2019-10-13 23:22:56,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:56,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 23:22:56,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745245133] [2019-10-13 23:22:56,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 23:22:56,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:56,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 23:22:56,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 23:22:56,623 INFO L87 Difference]: Start difference. First operand 5764 states and 6706 transitions. Second operand 4 states. [2019-10-13 23:22:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:56,945 INFO L93 Difference]: Finished difference Result 11106 states and 12961 transitions. [2019-10-13 23:22:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 23:22:56,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-10-13 23:22:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:56,975 INFO L225 Difference]: With dead ends: 11106 [2019-10-13 23:22:56,975 INFO L226 Difference]: Without dead ends: 5626 [2019-10-13 23:22:56,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states. [2019-10-13 23:22:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 5222. [2019-10-13 23:22:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-10-13 23:22:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 5897 transitions. [2019-10-13 23:22:57,279 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 5897 transitions. Word has length 134 [2019-10-13 23:22:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:57,280 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 5897 transitions. [2019-10-13 23:22:57,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 23:22:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 5897 transitions. [2019-10-13 23:22:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 23:22:57,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:57,284 INFO L380 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-13 23:22:57,284 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash -161297964, now seen corresponding path program 1 times [2019-10-13 23:22:57,284 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:57,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477181863] [2019-10-13 23:22:57,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:57,285 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:57,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:57,450 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-13 23:22:57,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477181863] [2019-10-13 23:22:57,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11704970] [2019-10-13 23:22:57,451 INFO L94 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-13 23:22:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:57,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 23:22:57,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:22:58,090 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-13 23:22:58,090 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:22:58,517 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-13 23:22:58,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 23:22:58,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 9] total 27 [2019-10-13 23:22:58,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007566130] [2019-10-13 23:22:58,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 23:22:58,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:58,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 23:22:58,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2019-10-13 23:22:58,519 INFO L87 Difference]: Start difference. First operand 5222 states and 5897 transitions. Second operand 11 states. [2019-10-13 23:23:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:23:00,220 INFO L93 Difference]: Finished difference Result 11708 states and 13140 transitions. [2019-10-13 23:23:00,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:23:00,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 146 [2019-10-13 23:23:00,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:23:00,258 INFO L225 Difference]: With dead ends: 11708 [2019-10-13 23:23:00,258 INFO L226 Difference]: Without dead ends: 6702 [2019-10-13 23:23:00,279 INFO L600 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-13 23:23:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2019-10-13 23:23:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 4921. [2019-10-13 23:23:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4921 states. [2019-10-13 23:23:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4921 states to 4921 states and 5487 transitions. [2019-10-13 23:23:00,650 INFO L78 Accepts]: Start accepts. Automaton has 4921 states and 5487 transitions. Word has length 146 [2019-10-13 23:23:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:23:00,650 INFO L462 AbstractCegarLoop]: Abstraction has 4921 states and 5487 transitions. [2019-10-13 23:23:00,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 23:23:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4921 states and 5487 transitions. [2019-10-13 23:23:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 23:23:00,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:23:00,657 INFO L380 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-13 23:23:00,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 23:23:00,936 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:23:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:23:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash -603300892, now seen corresponding path program 1 times [2019-10-13 23:23:00,938 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:23:00,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303528898] [2019-10-13 23:23:00,938 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:00,939 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:23:00,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:23:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:23:01,109 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-13 23:23:01,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303528898] [2019-10-13 23:23:01,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311772927] [2019-10-13 23:23:01,110 INFO L94 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