java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:25:09,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:25:09,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:25:09,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:25:09,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:25:09,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:25:09,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:25:09,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:25:09,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:25:09,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:25:09,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:25:09,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:25:09,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:25:09,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:25:09,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:25:09,404 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:25:09,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:25:09,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:25:09,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:25:09,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:25:09,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:25:09,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:25:09,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:25:09,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:25:09,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:25:09,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:25:09,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:25:09,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:25:09,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:25:09,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:25:09,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:25:09,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:25:09,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:25:09,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:25:09,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:25:09,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:25:09,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:25:09,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:25:09,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:25:09,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:25:09,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:25:09,444 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:25:09,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:25:09,479 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:25:09,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:25:09,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:25:09,484 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:25:09,484 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:25:09,484 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:25:09,484 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:25:09,485 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:25:09,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:25:09,485 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:25:09,485 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:25:09,485 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:25:09,486 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:25:09,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:25:09,486 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:25:09,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:25:09,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:25:09,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:25:09,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:25:09,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:25:09,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:25:09,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:25:09,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:25:09,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:25:09,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:25:09,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:25:09,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:25:09,493 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:25:09,783 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:25:09,797 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:25:09,801 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:25:09,803 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:25:09,803 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:25:09,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-13 21:25:09,887 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca6c8f2c/7591fd01d2fc41e581a96e023aef5367/FLAGb444467ce [2019-10-13 21:25:10,507 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:25:10,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-13 21:25:10,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca6c8f2c/7591fd01d2fc41e581a96e023aef5367/FLAGb444467ce [2019-10-13 21:25:10,767 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ca6c8f2c/7591fd01d2fc41e581a96e023aef5367 [2019-10-13 21:25:10,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:25:10,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:25:10,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:10,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:25:10,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:25:10,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:10" (1/1) ... [2019-10-13 21:25:10,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da87ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:10, skipping insertion in model container [2019-10-13 21:25:10,791 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:25:10" (1/1) ... [2019-10-13 21:25:10,800 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:25:10,862 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:25:11,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:11,328 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:25:11,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:25:11,437 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:25:11,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11 WrapperNode [2019-10-13 21:25:11,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:25:11,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:25:11,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:25:11,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:25:11,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11" (1/1) ... [2019-10-13 21:25:11,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11" (1/1) ... [2019-10-13 21:25:11,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11" (1/1) ... [2019-10-13 21:25:11,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11" (1/1) ... [2019-10-13 21:25:11,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11" (1/1) ... [2019-10-13 21:25:11,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11" (1/1) ... [2019-10-13 21:25:11,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11" (1/1) ... [2019-10-13 21:25:11,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:25:11,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:25:11,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:25:11,528 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:25:11,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:25:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:25:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:25:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-13 21:25:11,585 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-13 21:25:11,586 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-13 21:25:11,586 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-13 21:25:11,586 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-13 21:25:11,586 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-13 21:25:11,586 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-13 21:25:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-13 21:25:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 21:25:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-13 21:25:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-13 21:25:11,587 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-13 21:25:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-13 21:25:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-13 21:25:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 21:25:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:25:11,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 21:25:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:25:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:25:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:25:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:25:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:25:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:25:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:25:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-13 21:25:11,590 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-13 21:25:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-13 21:25:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-13 21:25:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-13 21:25:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-13 21:25:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-13 21:25:11,591 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-13 21:25:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:25:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-13 21:25:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-13 21:25:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-13 21:25:11,592 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-13 21:25:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-13 21:25:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:25:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:25:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:25:11,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:25:12,521 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:25:12,521 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:25:12,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:12 BoogieIcfgContainer [2019-10-13 21:25:12,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:25:12,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:25:12,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:25:12,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:25:12,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:25:10" (1/3) ... [2019-10-13 21:25:12,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3710355a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:12, skipping insertion in model container [2019-10-13 21:25:12,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:25:11" (2/3) ... [2019-10-13 21:25:12,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3710355a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:12, skipping insertion in model container [2019-10-13 21:25:12,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:12" (3/3) ... [2019-10-13 21:25:12,536 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2019-10-13 21:25:12,546 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:25:12,555 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:25:12,568 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:25:12,604 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:25:12,604 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:25:12,604 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:25:12,604 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:25:12,605 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:25:12,605 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:25:12,605 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:25:12,605 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:25:12,633 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states. [2019-10-13 21:25:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 21:25:12,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:12,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:12,646 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:12,651 INFO L82 PathProgramCache]: Analyzing trace with hash -512765460, now seen corresponding path program 1 times [2019-10-13 21:25:12,659 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:12,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205899177] [2019-10-13 21:25:12,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,660 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:13,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205899177] [2019-10-13 21:25:13,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:13,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:13,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700191073] [2019-10-13 21:25:13,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:13,176 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:13,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:13,196 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 4 states. [2019-10-13 21:25:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:13,347 INFO L93 Difference]: Finished difference Result 455 states and 698 transitions. [2019-10-13 21:25:13,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:13,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-13 21:25:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:13,379 INFO L225 Difference]: With dead ends: 455 [2019-10-13 21:25:13,379 INFO L226 Difference]: Without dead ends: 232 [2019-10-13 21:25:13,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-10-13 21:25:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-10-13 21:25:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-10-13 21:25:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 324 transitions. [2019-10-13 21:25:13,461 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 324 transitions. Word has length 65 [2019-10-13 21:25:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:13,461 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 324 transitions. [2019-10-13 21:25:13,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:13,462 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 324 transitions. [2019-10-13 21:25:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 21:25:13,470 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:13,470 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:13,471 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1221172995, now seen corresponding path program 1 times [2019-10-13 21:25:13,471 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:13,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390661213] [2019-10-13 21:25:13,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:13,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:13,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390661213] [2019-10-13 21:25:13,730 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:13,730 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:13,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158803272] [2019-10-13 21:25:13,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:13,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:13,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:13,736 INFO L87 Difference]: Start difference. First operand 232 states and 324 transitions. Second operand 4 states. [2019-10-13 21:25:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:13,836 INFO L93 Difference]: Finished difference Result 446 states and 636 transitions. [2019-10-13 21:25:13,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:13,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-13 21:25:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:13,843 INFO L225 Difference]: With dead ends: 446 [2019-10-13 21:25:13,843 INFO L226 Difference]: Without dead ends: 236 [2019-10-13 21:25:13,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:13,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-10-13 21:25:13,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2019-10-13 21:25:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-13 21:25:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 327 transitions. [2019-10-13 21:25:13,872 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 327 transitions. Word has length 76 [2019-10-13 21:25:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:13,873 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 327 transitions. [2019-10-13 21:25:13,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 327 transitions. [2019-10-13 21:25:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:25:13,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:13,876 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:13,876 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2093661207, now seen corresponding path program 1 times [2019-10-13 21:25:13,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:13,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874289298] [2019-10-13 21:25:13,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:14,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874289298] [2019-10-13 21:25:14,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:14,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:14,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450770899] [2019-10-13 21:25:14,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:14,080 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:14,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:14,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:14,081 INFO L87 Difference]: Start difference. First operand 236 states and 327 transitions. Second operand 7 states. [2019-10-13 21:25:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:15,503 INFO L93 Difference]: Finished difference Result 537 states and 746 transitions. [2019-10-13 21:25:15,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:15,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-13 21:25:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:15,511 INFO L225 Difference]: With dead ends: 537 [2019-10-13 21:25:15,511 INFO L226 Difference]: Without dead ends: 323 [2019-10-13 21:25:15,512 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:25:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-10-13 21:25:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2019-10-13 21:25:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-13 21:25:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-10-13 21:25:15,545 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 94 [2019-10-13 21:25:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:15,546 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-10-13 21:25:15,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-10-13 21:25:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:25:15,548 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:15,548 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:15,549 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:15,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash 130349043, now seen corresponding path program 1 times [2019-10-13 21:25:15,549 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:15,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737457041] [2019-10-13 21:25:15,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,550 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:15,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:15,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737457041] [2019-10-13 21:25:15,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:15,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:15,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528826723] [2019-10-13 21:25:15,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:15,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:15,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:15,703 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 7 states. [2019-10-13 21:25:16,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:16,862 INFO L93 Difference]: Finished difference Result 543 states and 754 transitions. [2019-10-13 21:25:16,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:16,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:25:16,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:16,866 INFO L225 Difference]: With dead ends: 543 [2019-10-13 21:25:16,867 INFO L226 Difference]: Without dead ends: 326 [2019-10-13 21:25:16,868 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:25:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-13 21:25:16,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 322. [2019-10-13 21:25:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-13 21:25:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 439 transitions. [2019-10-13 21:25:16,894 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 439 transitions. Word has length 95 [2019-10-13 21:25:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:16,895 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 439 transitions. [2019-10-13 21:25:16,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:16,895 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 439 transitions. [2019-10-13 21:25:16,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:25:16,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:16,897 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:16,897 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:16,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1810109727, now seen corresponding path program 1 times [2019-10-13 21:25:16,898 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:16,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459369303] [2019-10-13 21:25:16,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:16,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:16,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:17,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459369303] [2019-10-13 21:25:17,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:17,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:17,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542791463] [2019-10-13 21:25:17,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:17,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:17,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:17,017 INFO L87 Difference]: Start difference. First operand 322 states and 439 transitions. Second operand 3 states. [2019-10-13 21:25:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:17,079 INFO L93 Difference]: Finished difference Result 773 states and 1078 transitions. [2019-10-13 21:25:17,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:17,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-13 21:25:17,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:17,088 INFO L225 Difference]: With dead ends: 773 [2019-10-13 21:25:17,088 INFO L226 Difference]: Without dead ends: 556 [2019-10-13 21:25:17,090 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-10-13 21:25:17,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 538. [2019-10-13 21:25:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-13 21:25:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 746 transitions. [2019-10-13 21:25:17,176 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 746 transitions. Word has length 97 [2019-10-13 21:25:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:17,176 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 746 transitions. [2019-10-13 21:25:17,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 746 transitions. [2019-10-13 21:25:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:25:17,184 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:17,185 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:17,185 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:17,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1438423074, now seen corresponding path program 1 times [2019-10-13 21:25:17,187 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:17,187 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931006673] [2019-10-13 21:25:17,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:17,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:17,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931006673] [2019-10-13 21:25:17,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:17,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:17,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138424007] [2019-10-13 21:25:17,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:17,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:17,362 INFO L87 Difference]: Start difference. First operand 538 states and 746 transitions. Second operand 3 states. [2019-10-13 21:25:17,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:17,412 INFO L93 Difference]: Finished difference Result 929 states and 1310 transitions. [2019-10-13 21:25:17,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:17,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-13 21:25:17,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:17,418 INFO L225 Difference]: With dead ends: 929 [2019-10-13 21:25:17,418 INFO L226 Difference]: Without dead ends: 538 [2019-10-13 21:25:17,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-10-13 21:25:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-10-13 21:25:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-13 21:25:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 745 transitions. [2019-10-13 21:25:17,468 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 745 transitions. Word has length 98 [2019-10-13 21:25:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:17,470 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 745 transitions. [2019-10-13 21:25:17,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 745 transitions. [2019-10-13 21:25:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:25:17,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:17,472 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:17,472 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:17,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash 737358496, now seen corresponding path program 1 times [2019-10-13 21:25:17,473 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:17,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475151301] [2019-10-13 21:25:17,473 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,474 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:17,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475151301] [2019-10-13 21:25:17,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:17,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:17,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941371017] [2019-10-13 21:25:17,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:17,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:17,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:17,584 INFO L87 Difference]: Start difference. First operand 538 states and 745 transitions. Second operand 3 states. [2019-10-13 21:25:17,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:17,646 INFO L93 Difference]: Finished difference Result 1171 states and 1643 transitions. [2019-10-13 21:25:17,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:17,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-13 21:25:17,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:17,653 INFO L225 Difference]: With dead ends: 1171 [2019-10-13 21:25:17,653 INFO L226 Difference]: Without dead ends: 730 [2019-10-13 21:25:17,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:17,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-13 21:25:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2019-10-13 21:25:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-10-13 21:25:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1010 transitions. [2019-10-13 21:25:17,720 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1010 transitions. Word has length 98 [2019-10-13 21:25:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:17,720 INFO L462 AbstractCegarLoop]: Abstraction has 724 states and 1010 transitions. [2019-10-13 21:25:17,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1010 transitions. [2019-10-13 21:25:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:25:17,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:17,722 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:17,723 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:17,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash -638890142, now seen corresponding path program 1 times [2019-10-13 21:25:17,723 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:17,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609953923] [2019-10-13 21:25:17,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:17,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:17,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609953923] [2019-10-13 21:25:17,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:17,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:17,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878892978] [2019-10-13 21:25:17,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:17,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:17,847 INFO L87 Difference]: Start difference. First operand 724 states and 1010 transitions. Second operand 4 states. [2019-10-13 21:25:17,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:17,922 INFO L93 Difference]: Finished difference Result 1312 states and 1857 transitions. [2019-10-13 21:25:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:17,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-13 21:25:17,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:17,929 INFO L225 Difference]: With dead ends: 1312 [2019-10-13 21:25:17,929 INFO L226 Difference]: Without dead ends: 739 [2019-10-13 21:25:17,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2019-10-13 21:25:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 739. [2019-10-13 21:25:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-10-13 21:25:17,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1022 transitions. [2019-10-13 21:25:17,987 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1022 transitions. Word has length 98 [2019-10-13 21:25:17,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:17,987 INFO L462 AbstractCegarLoop]: Abstraction has 739 states and 1022 transitions. [2019-10-13 21:25:17,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:17,987 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1022 transitions. [2019-10-13 21:25:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 21:25:17,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:17,991 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:17,991 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:17,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash -397676862, now seen corresponding path program 1 times [2019-10-13 21:25:17,992 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:17,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437953699] [2019-10-13 21:25:17,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,993 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:18,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437953699] [2019-10-13 21:25:18,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:18,151 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:18,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196434285] [2019-10-13 21:25:18,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:18,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:18,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:18,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:18,156 INFO L87 Difference]: Start difference. First operand 739 states and 1022 transitions. Second operand 4 states. [2019-10-13 21:25:18,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:18,274 INFO L93 Difference]: Finished difference Result 1342 states and 1890 transitions. [2019-10-13 21:25:18,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:18,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 21:25:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:18,281 INFO L225 Difference]: With dead ends: 1342 [2019-10-13 21:25:18,281 INFO L226 Difference]: Without dead ends: 754 [2019-10-13 21:25:18,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-10-13 21:25:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-10-13 21:25:18,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-10-13 21:25:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1034 transitions. [2019-10-13 21:25:18,335 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1034 transitions. Word has length 106 [2019-10-13 21:25:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:18,336 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1034 transitions. [2019-10-13 21:25:18,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1034 transitions. [2019-10-13 21:25:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:25:18,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:18,338 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:18,339 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:18,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1572879564, now seen corresponding path program 1 times [2019-10-13 21:25:18,339 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:18,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261229592] [2019-10-13 21:25:18,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:18,432 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261229592] [2019-10-13 21:25:18,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:18,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:18,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634976949] [2019-10-13 21:25:18,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:18,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:18,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:18,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:18,435 INFO L87 Difference]: Start difference. First operand 754 states and 1034 transitions. Second operand 4 states. [2019-10-13 21:25:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:18,510 INFO L93 Difference]: Finished difference Result 1369 states and 1902 transitions. [2019-10-13 21:25:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:18,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:25:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:18,516 INFO L225 Difference]: With dead ends: 1369 [2019-10-13 21:25:18,516 INFO L226 Difference]: Without dead ends: 766 [2019-10-13 21:25:18,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:18,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2019-10-13 21:25:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2019-10-13 21:25:18,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2019-10-13 21:25:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1043 transitions. [2019-10-13 21:25:18,563 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1043 transitions. Word has length 114 [2019-10-13 21:25:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:18,563 INFO L462 AbstractCegarLoop]: Abstraction has 766 states and 1043 transitions. [2019-10-13 21:25:18,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1043 transitions. [2019-10-13 21:25:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:25:18,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:18,566 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:18,566 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:18,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:18,567 INFO L82 PathProgramCache]: Analyzing trace with hash -156798744, now seen corresponding path program 1 times [2019-10-13 21:25:18,567 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:18,567 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387799364] [2019-10-13 21:25:18,567 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:18,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387799364] [2019-10-13 21:25:18,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:18,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:18,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120224590] [2019-10-13 21:25:18,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:18,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:18,652 INFO L87 Difference]: Start difference. First operand 766 states and 1043 transitions. Second operand 4 states. [2019-10-13 21:25:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:18,728 INFO L93 Difference]: Finished difference Result 1396 states and 1932 transitions. [2019-10-13 21:25:18,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:18,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:25:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:18,733 INFO L225 Difference]: With dead ends: 1396 [2019-10-13 21:25:18,734 INFO L226 Difference]: Without dead ends: 781 [2019-10-13 21:25:18,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:18,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-10-13 21:25:18,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 781. [2019-10-13 21:25:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-13 21:25:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1055 transitions. [2019-10-13 21:25:18,778 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1055 transitions. Word has length 114 [2019-10-13 21:25:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:18,778 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1055 transitions. [2019-10-13 21:25:18,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:18,779 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1055 transitions. [2019-10-13 21:25:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:25:18,781 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:18,782 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:18,782 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:18,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:18,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1699235052, now seen corresponding path program 1 times [2019-10-13 21:25:18,783 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:18,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491029471] [2019-10-13 21:25:18,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,783 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:18,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-13 21:25:18,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491029471] [2019-10-13 21:25:18,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:18,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:18,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080133869] [2019-10-13 21:25:18,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:18,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:18,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:18,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:18,929 INFO L87 Difference]: Start difference. First operand 781 states and 1055 transitions. Second operand 4 states. [2019-10-13 21:25:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:19,014 INFO L93 Difference]: Finished difference Result 1429 states and 1953 transitions. [2019-10-13 21:25:19,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:19,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-10-13 21:25:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:19,021 INFO L225 Difference]: With dead ends: 1429 [2019-10-13 21:25:19,021 INFO L226 Difference]: Without dead ends: 799 [2019-10-13 21:25:19,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2019-10-13 21:25:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2019-10-13 21:25:19,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-10-13 21:25:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1070 transitions. [2019-10-13 21:25:19,066 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1070 transitions. Word has length 122 [2019-10-13 21:25:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:19,069 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1070 transitions. [2019-10-13 21:25:19,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1070 transitions. [2019-10-13 21:25:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 21:25:19,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:19,073 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:19,073 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:19,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash 820674453, now seen corresponding path program 1 times [2019-10-13 21:25:19,074 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:19,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740090384] [2019-10-13 21:25:19,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:19,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:19,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:25:19,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740090384] [2019-10-13 21:25:19,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:19,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:25:19,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774072717] [2019-10-13 21:25:19,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:25:19,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:19,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:25:19,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:25:19,315 INFO L87 Difference]: Start difference. First operand 799 states and 1070 transitions. Second operand 10 states. [2019-10-13 21:25:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:22,157 INFO L93 Difference]: Finished difference Result 2091 states and 2782 transitions. [2019-10-13 21:25:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:25:22,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 127 [2019-10-13 21:25:22,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:22,170 INFO L225 Difference]: With dead ends: 2091 [2019-10-13 21:25:22,171 INFO L226 Difference]: Without dead ends: 1434 [2019-10-13 21:25:22,174 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:25:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-10-13 21:25:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1337. [2019-10-13 21:25:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1337 states. [2019-10-13 21:25:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1760 transitions. [2019-10-13 21:25:22,257 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1760 transitions. Word has length 127 [2019-10-13 21:25:22,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:22,258 INFO L462 AbstractCegarLoop]: Abstraction has 1337 states and 1760 transitions. [2019-10-13 21:25:22,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:25:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1760 transitions. [2019-10-13 21:25:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:25:22,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:22,261 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:22,261 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:22,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:22,261 INFO L82 PathProgramCache]: Analyzing trace with hash -191192024, now seen corresponding path program 1 times [2019-10-13 21:25:22,262 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:22,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146819280] [2019-10-13 21:25:22,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:22,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:22,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:25:22,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146819280] [2019-10-13 21:25:22,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:22,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:22,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071932603] [2019-10-13 21:25:22,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:22,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:22,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:22,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:22,360 INFO L87 Difference]: Start difference. First operand 1337 states and 1760 transitions. Second operand 4 states. [2019-10-13 21:25:22,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:22,444 INFO L93 Difference]: Finished difference Result 2426 states and 3213 transitions. [2019-10-13 21:25:22,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:22,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-10-13 21:25:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:22,452 INFO L225 Difference]: With dead ends: 2426 [2019-10-13 21:25:22,452 INFO L226 Difference]: Without dead ends: 1349 [2019-10-13 21:25:22,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2019-10-13 21:25:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1343. [2019-10-13 21:25:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-10-13 21:25:22,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1747 transitions. [2019-10-13 21:25:22,523 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1747 transitions. Word has length 129 [2019-10-13 21:25:22,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:22,524 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1747 transitions. [2019-10-13 21:25:22,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1747 transitions. [2019-10-13 21:25:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-13 21:25:22,527 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:22,527 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:22,527 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:22,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1773246243, now seen corresponding path program 1 times [2019-10-13 21:25:22,528 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:22,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426558022] [2019-10-13 21:25:22,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:22,528 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:22,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-13 21:25:22,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426558022] [2019-10-13 21:25:22,662 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:22,662 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:22,662 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738720286] [2019-10-13 21:25:22,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:22,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:22,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:22,664 INFO L87 Difference]: Start difference. First operand 1343 states and 1747 transitions. Second operand 9 states. [2019-10-13 21:25:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,836 INFO L93 Difference]: Finished difference Result 2767 states and 3573 transitions. [2019-10-13 21:25:24,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:25:24,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2019-10-13 21:25:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,846 INFO L225 Difference]: With dead ends: 2767 [2019-10-13 21:25:24,847 INFO L226 Difference]: Without dead ends: 1735 [2019-10-13 21:25:24,852 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:25:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2019-10-13 21:25:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1466. [2019-10-13 21:25:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2019-10-13 21:25:24,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1881 transitions. [2019-10-13 21:25:24,935 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1881 transitions. Word has length 131 [2019-10-13 21:25:24,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,935 INFO L462 AbstractCegarLoop]: Abstraction has 1466 states and 1881 transitions. [2019-10-13 21:25:24,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1881 transitions. [2019-10-13 21:25:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:25:24,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,938 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:24,939 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,939 INFO L82 PathProgramCache]: Analyzing trace with hash 46760133, now seen corresponding path program 1 times [2019-10-13 21:25:24,939 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,940 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580395120] [2019-10-13 21:25:24,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:25:25,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580395120] [2019-10-13 21:25:25,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:25:25,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137237903] [2019-10-13 21:25:25,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:25:25,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:25:25,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:25:25,137 INFO L87 Difference]: Start difference. First operand 1466 states and 1881 transitions. Second operand 8 states. [2019-10-13 21:25:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:25,275 INFO L93 Difference]: Finished difference Result 1567 states and 2024 transitions. [2019-10-13 21:25:25,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:25,276 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 130 [2019-10-13 21:25:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:25,287 INFO L225 Difference]: With dead ends: 1567 [2019-10-13 21:25:25,287 INFO L226 Difference]: Without dead ends: 1565 [2019-10-13 21:25:25,289 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:25:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2019-10-13 21:25:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1487. [2019-10-13 21:25:25,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-10-13 21:25:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 1904 transitions. [2019-10-13 21:25:25,385 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 1904 transitions. Word has length 130 [2019-10-13 21:25:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,385 INFO L462 AbstractCegarLoop]: Abstraction has 1487 states and 1904 transitions. [2019-10-13 21:25:25,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:25:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 1904 transitions. [2019-10-13 21:25:25,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:25:25,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,389 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:25,389 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,390 INFO L82 PathProgramCache]: Analyzing trace with hash -590455559, now seen corresponding path program 1 times [2019-10-13 21:25:25,390 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,390 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244088161] [2019-10-13 21:25:25,390 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,391 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 21:25:25,619 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244088161] [2019-10-13 21:25:25,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:25:25,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367789941] [2019-10-13 21:25:25,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:25:25,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:25:25,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:25:25,622 INFO L87 Difference]: Start difference. First operand 1487 states and 1904 transitions. Second operand 10 states. [2019-10-13 21:25:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:29,479 INFO L93 Difference]: Finished difference Result 3893 states and 4953 transitions. [2019-10-13 21:25:29,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:25:29,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 135 [2019-10-13 21:25:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:29,494 INFO L225 Difference]: With dead ends: 3893 [2019-10-13 21:25:29,494 INFO L226 Difference]: Without dead ends: 2759 [2019-10-13 21:25:29,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-10-13 21:25:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2759 states. [2019-10-13 21:25:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2759 to 1912. [2019-10-13 21:25:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1912 states. [2019-10-13 21:25:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1912 states to 1912 states and 2434 transitions. [2019-10-13 21:25:29,640 INFO L78 Accepts]: Start accepts. Automaton has 1912 states and 2434 transitions. Word has length 135 [2019-10-13 21:25:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:29,641 INFO L462 AbstractCegarLoop]: Abstraction has 1912 states and 2434 transitions. [2019-10-13 21:25:29,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:25:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1912 states and 2434 transitions. [2019-10-13 21:25:29,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:25:29,645 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:29,646 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:29,646 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:29,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:29,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1460592206, now seen corresponding path program 1 times [2019-10-13 21:25:29,647 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:29,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465228808] [2019-10-13 21:25:29,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:29,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:29,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:29,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465228808] [2019-10-13 21:25:29,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:29,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:29,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531438227] [2019-10-13 21:25:29,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:29,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:29,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:29,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:29,816 INFO L87 Difference]: Start difference. First operand 1912 states and 2434 transitions. Second operand 5 states. [2019-10-13 21:25:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:30,380 INFO L93 Difference]: Finished difference Result 6600 states and 8502 transitions. [2019-10-13 21:25:30,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:30,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-13 21:25:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:30,409 INFO L225 Difference]: With dead ends: 6600 [2019-10-13 21:25:30,410 INFO L226 Difference]: Without dead ends: 4986 [2019-10-13 21:25:30,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2019-10-13 21:25:30,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 4528. [2019-10-13 21:25:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4528 states. [2019-10-13 21:25:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4528 states to 4528 states and 5778 transitions. [2019-10-13 21:25:30,721 INFO L78 Accepts]: Start accepts. Automaton has 4528 states and 5778 transitions. Word has length 136 [2019-10-13 21:25:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:30,722 INFO L462 AbstractCegarLoop]: Abstraction has 4528 states and 5778 transitions. [2019-10-13 21:25:30,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:30,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4528 states and 5778 transitions. [2019-10-13 21:25:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:25:30,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:30,726 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:30,727 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:30,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:30,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1646731592, now seen corresponding path program 1 times [2019-10-13 21:25:30,727 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:30,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636435648] [2019-10-13 21:25:30,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:30,728 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:30,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:30,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636435648] [2019-10-13 21:25:30,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:30,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:30,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891363939] [2019-10-13 21:25:30,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:30,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:30,867 INFO L87 Difference]: Start difference. First operand 4528 states and 5778 transitions. Second operand 4 states. [2019-10-13 21:25:31,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:31,372 INFO L93 Difference]: Finished difference Result 8498 states and 10873 transitions. [2019-10-13 21:25:31,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:31,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:25:31,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:31,399 INFO L225 Difference]: With dead ends: 8498 [2019-10-13 21:25:31,399 INFO L226 Difference]: Without dead ends: 4569 [2019-10-13 21:25:31,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-10-13 21:25:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4142. [2019-10-13 21:25:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4142 states. [2019-10-13 21:25:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4142 states to 4142 states and 5285 transitions. [2019-10-13 21:25:31,649 INFO L78 Accepts]: Start accepts. Automaton has 4142 states and 5285 transitions. Word has length 140 [2019-10-13 21:25:31,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:31,650 INFO L462 AbstractCegarLoop]: Abstraction has 4142 states and 5285 transitions. [2019-10-13 21:25:31,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4142 states and 5285 transitions. [2019-10-13 21:25:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:25:31,654 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:31,654 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:31,655 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:31,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:31,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1163137124, now seen corresponding path program 1 times [2019-10-13 21:25:31,655 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:31,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799717769] [2019-10-13 21:25:31,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:31,656 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:31,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:31,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:25:31,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799717769] [2019-10-13 21:25:31,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:31,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:31,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996506269] [2019-10-13 21:25:31,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:31,854 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:31,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:31,855 INFO L87 Difference]: Start difference. First operand 4142 states and 5285 transitions. Second operand 9 states. [2019-10-13 21:25:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:33,267 INFO L93 Difference]: Finished difference Result 7586 states and 9744 transitions. [2019-10-13 21:25:33,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:25:33,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-10-13 21:25:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:33,298 INFO L225 Difference]: With dead ends: 7586 [2019-10-13 21:25:33,299 INFO L226 Difference]: Without dead ends: 3861 [2019-10-13 21:25:33,309 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:25:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2019-10-13 21:25:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3502. [2019-10-13 21:25:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3502 states. [2019-10-13 21:25:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 4460 transitions. [2019-10-13 21:25:33,512 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 4460 transitions. Word has length 137 [2019-10-13 21:25:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:33,513 INFO L462 AbstractCegarLoop]: Abstraction has 3502 states and 4460 transitions. [2019-10-13 21:25:33,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:33,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4460 transitions. [2019-10-13 21:25:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:25:33,515 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:33,515 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:33,516 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash -548829752, now seen corresponding path program 1 times [2019-10-13 21:25:33,516 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:33,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468415333] [2019-10-13 21:25:33,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:33,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:33,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-13 21:25:33,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468415333] [2019-10-13 21:25:33,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:33,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:33,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899855115] [2019-10-13 21:25:33,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:33,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:33,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:33,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:33,711 INFO L87 Difference]: Start difference. First operand 3502 states and 4460 transitions. Second operand 9 states. [2019-10-13 21:25:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:35,385 INFO L93 Difference]: Finished difference Result 7114 states and 9207 transitions. [2019-10-13 21:25:35,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:25:35,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2019-10-13 21:25:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:35,406 INFO L225 Difference]: With dead ends: 7114 [2019-10-13 21:25:35,406 INFO L226 Difference]: Without dead ends: 3968 [2019-10-13 21:25:35,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:25:35,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-10-13 21:25:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3403. [2019-10-13 21:25:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3403 states. [2019-10-13 21:25:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 4335 transitions. [2019-10-13 21:25:35,636 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 4335 transitions. Word has length 138 [2019-10-13 21:25:35,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:35,637 INFO L462 AbstractCegarLoop]: Abstraction has 3403 states and 4335 transitions. [2019-10-13 21:25:35,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:35,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 4335 transitions. [2019-10-13 21:25:35,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:25:35,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:35,640 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:35,640 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:35,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1954100026, now seen corresponding path program 1 times [2019-10-13 21:25:35,641 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:35,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885949350] [2019-10-13 21:25:35,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:35,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:35,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:35,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885949350] [2019-10-13 21:25:35,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:35,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:35,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637417607] [2019-10-13 21:25:35,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:35,761 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:35,763 INFO L87 Difference]: Start difference. First operand 3403 states and 4335 transitions. Second operand 5 states. [2019-10-13 21:25:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:36,394 INFO L93 Difference]: Finished difference Result 10469 states and 13451 transitions. [2019-10-13 21:25:36,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:36,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-13 21:25:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:36,501 INFO L225 Difference]: With dead ends: 10469 [2019-10-13 21:25:36,501 INFO L226 Difference]: Without dead ends: 7583 [2019-10-13 21:25:36,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7583 states. [2019-10-13 21:25:36,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7583 to 5220. [2019-10-13 21:25:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-10-13 21:25:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6641 transitions. [2019-10-13 21:25:36,854 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6641 transitions. Word has length 139 [2019-10-13 21:25:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:36,855 INFO L462 AbstractCegarLoop]: Abstraction has 5220 states and 6641 transitions. [2019-10-13 21:25:36,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6641 transitions. [2019-10-13 21:25:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:25:36,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:36,859 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:36,859 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:36,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:36,860 INFO L82 PathProgramCache]: Analyzing trace with hash 392021161, now seen corresponding path program 1 times [2019-10-13 21:25:36,860 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:36,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990015034] [2019-10-13 21:25:36,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:36,860 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:36,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:36,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990015034] [2019-10-13 21:25:36,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:36,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:36,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326059987] [2019-10-13 21:25:36,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:36,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:36,934 INFO L87 Difference]: Start difference. First operand 5220 states and 6641 transitions. Second operand 5 states. [2019-10-13 21:25:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:37,786 INFO L93 Difference]: Finished difference Result 12108 states and 15464 transitions. [2019-10-13 21:25:37,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:37,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-13 21:25:37,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:37,820 INFO L225 Difference]: With dead ends: 12108 [2019-10-13 21:25:37,820 INFO L226 Difference]: Without dead ends: 7544 [2019-10-13 21:25:37,836 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2019-10-13 21:25:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6994. [2019-10-13 21:25:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6994 states. [2019-10-13 21:25:38,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6994 states to 6994 states and 8852 transitions. [2019-10-13 21:25:38,349 INFO L78 Accepts]: Start accepts. Automaton has 6994 states and 8852 transitions. Word has length 139 [2019-10-13 21:25:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:38,350 INFO L462 AbstractCegarLoop]: Abstraction has 6994 states and 8852 transitions. [2019-10-13 21:25:38,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6994 states and 8852 transitions. [2019-10-13 21:25:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:25:38,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:38,355 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:38,355 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1910003468, now seen corresponding path program 1 times [2019-10-13 21:25:38,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:38,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957968955] [2019-10-13 21:25:38,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:38,356 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:38,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:38,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957968955] [2019-10-13 21:25:38,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:38,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:38,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112954243] [2019-10-13 21:25:38,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:38,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:38,407 INFO L87 Difference]: Start difference. First operand 6994 states and 8852 transitions. Second operand 3 states. [2019-10-13 21:25:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:38,725 INFO L93 Difference]: Finished difference Result 13467 states and 17115 transitions. [2019-10-13 21:25:38,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:38,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-13 21:25:38,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:38,751 INFO L225 Difference]: With dead ends: 13467 [2019-10-13 21:25:38,751 INFO L226 Difference]: Without dead ends: 7063 [2019-10-13 21:25:38,767 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7063 states. [2019-10-13 21:25:39,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7063 to 7000. [2019-10-13 21:25:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7000 states. [2019-10-13 21:25:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7000 states to 7000 states and 8858 transitions. [2019-10-13 21:25:39,370 INFO L78 Accepts]: Start accepts. Automaton has 7000 states and 8858 transitions. Word has length 140 [2019-10-13 21:25:39,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:39,370 INFO L462 AbstractCegarLoop]: Abstraction has 7000 states and 8858 transitions. [2019-10-13 21:25:39,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 7000 states and 8858 transitions. [2019-10-13 21:25:39,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:25:39,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:39,374 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:39,374 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:39,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1697402299, now seen corresponding path program 1 times [2019-10-13 21:25:39,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:39,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720109469] [2019-10-13 21:25:39,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:39,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:39,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720109469] [2019-10-13 21:25:39,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:39,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:25:39,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152254797] [2019-10-13 21:25:39,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:25:39,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:39,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:25:39,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:25:39,682 INFO L87 Difference]: Start difference. First operand 7000 states and 8858 transitions. Second operand 12 states.