java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:24:57,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:24:57,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:24:57,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:24:57,316 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:24:57,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:24:57,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:24:57,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:24:57,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:24:57,335 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:24:57,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:24:57,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:24:57,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:24:57,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:24:57,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:24:57,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:24:57,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:24:57,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:24:57,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:24:57,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:24:57,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:24:57,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:24:57,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:24:57,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:24:57,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:24:57,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:24:57,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:24:57,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:24:57,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:24:57,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:24:57,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:24:57,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:24:57,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:24:57,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:24:57,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:24:57,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:24:57,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:24:57,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:24:57,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:24:57,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:24:57,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:24:57,365 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:24:57,379 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:24:57,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:24:57,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:24:57,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:24:57,382 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:24:57,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:24:57,382 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:24:57,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:24:57,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:24:57,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:24:57,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:24:57,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:24:57,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:24:57,383 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:24:57,384 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:24:57,384 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:24:57,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:24:57,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:24:57,385 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:24:57,385 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:24:57,385 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:24:57,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:24:57,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:24:57,386 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:24:57,386 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:24:57,386 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:24:57,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:24:57,386 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:24:57,386 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:24:57,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:24:57,709 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:24:57,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:24:57,715 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:24:57,715 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:24:57,716 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-13 21:24:57,799 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1708f655/5d610a27539c402da165a2b626adecc9/FLAG4871d899c [2019-10-13 21:24:58,312 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:24:58,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-13 21:24:58,328 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1708f655/5d610a27539c402da165a2b626adecc9/FLAG4871d899c [2019-10-13 21:24:58,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1708f655/5d610a27539c402da165a2b626adecc9 [2019-10-13 21:24:58,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:24:58,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:24:58,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:58,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:24:58,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:24:58,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:58" (1/1) ... [2019-10-13 21:24:58,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@405f9137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:58, skipping insertion in model container [2019-10-13 21:24:58,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:58" (1/1) ... [2019-10-13 21:24:58,670 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:24:58,741 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:24:59,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:59,152 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:24:59,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:24:59,279 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:24:59,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59 WrapperNode [2019-10-13 21:24:59,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:24:59,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:24:59,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:24:59,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:24:59,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59" (1/1) ... [2019-10-13 21:24:59,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59" (1/1) ... [2019-10-13 21:24:59,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59" (1/1) ... [2019-10-13 21:24:59,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59" (1/1) ... [2019-10-13 21:24:59,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59" (1/1) ... [2019-10-13 21:24:59,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59" (1/1) ... [2019-10-13 21:24:59,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59" (1/1) ... [2019-10-13 21:24:59,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:24:59,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:24:59,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:24:59,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:24:59,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59" (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:24:59,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:24:59,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:24:59,422 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side1_failed_history [2019-10-13 21:24:59,422 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2019-10-13 21:24:59,423 INFO L138 BoogieDeclarations]: Found implementation of procedure write_side2_failed_history [2019-10-13 21:24:59,423 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2019-10-13 21:24:59,423 INFO L138 BoogieDeclarations]: Found implementation of procedure write_active_side_history [2019-10-13 21:24:59,423 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2019-10-13 21:24:59,423 INFO L138 BoogieDeclarations]: Found implementation of procedure write_manual_selection_history [2019-10-13 21:24:59,423 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2019-10-13 21:24:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-13 21:24:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2019-10-13 21:24:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure Console_task_each_pals_period [2019-10-13 21:24:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure Side1_activestandby_task_each_pals_period [2019-10-13 21:24:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure Side2_activestandby_task_each_pals_period [2019-10-13 21:24:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure Pendulum_prism_task_each_pals_period [2019-10-13 21:24:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-13 21:24:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:24:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-13 21:24:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:24:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 21:24:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 21:24:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 21:24:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 21:24:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 21:24:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:24:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure write_side1_failed_history [2019-10-13 21:24:59,426 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2019-10-13 21:24:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure write_side2_failed_history [2019-10-13 21:24:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2019-10-13 21:24:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure write_active_side_history [2019-10-13 21:24:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2019-10-13 21:24:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure write_manual_selection_history [2019-10-13 21:24:59,427 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2019-10-13 21:24:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 21:24:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2019-10-13 21:24:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure Console_task_each_pals_period [2019-10-13 21:24:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure Side1_activestandby_task_each_pals_period [2019-10-13 21:24:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure Side2_activestandby_task_each_pals_period [2019-10-13 21:24:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure Pendulum_prism_task_each_pals_period [2019-10-13 21:24:59,428 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 21:24:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:24:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:24:59,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:25:00,280 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:25:00,280 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 21:25:00,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:00 BoogieIcfgContainer [2019-10-13 21:25:00,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:25:00,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:25:00,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:25:00,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:25:00,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:58" (1/3) ... [2019-10-13 21:25:00,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be8627c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:00, skipping insertion in model container [2019-10-13 21:25:00,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:59" (2/3) ... [2019-10-13 21:25:00,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be8627c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:25:00, skipping insertion in model container [2019-10-13 21:25:00,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:25:00" (3/3) ... [2019-10-13 21:25:00,296 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2019-10-13 21:25:00,305 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:25:00,314 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:25:00,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:25:00,353 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:25:00,353 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:25:00,354 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:25:00,354 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:25:00,354 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:25:00,354 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:25:00,355 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:25:00,355 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:25:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states. [2019-10-13 21:25:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 21:25:00,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:00,407 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:00,412 INFO L410 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:00,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1497229254, now seen corresponding path program 1 times [2019-10-13 21:25:00,426 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:00,426 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119809618] [2019-10-13 21:25:00,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:00,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:00,824 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:00,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119809618] [2019-10-13 21:25:00,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:00,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:00,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069219188] [2019-10-13 21:25:00,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:00,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:00,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:00,855 INFO L87 Difference]: Start difference. First operand 235 states. Second operand 4 states. [2019-10-13 21:25:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:00,971 INFO L93 Difference]: Finished difference Result 451 states and 690 transitions. [2019-10-13 21:25:00,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:00,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-13 21:25:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:00,993 INFO L225 Difference]: With dead ends: 451 [2019-10-13 21:25:00,993 INFO L226 Difference]: Without dead ends: 230 [2019-10-13 21:25:01,000 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:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-13 21:25:01,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-10-13 21:25:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-13 21:25:01,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 320 transitions. [2019-10-13 21:25:01,070 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 320 transitions. Word has length 65 [2019-10-13 21:25:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:01,070 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 320 transitions. [2019-10-13 21:25:01,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 320 transitions. [2019-10-13 21:25:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 21:25:01,075 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:01,075 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:01,075 INFO L410 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:01,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1347913347, now seen corresponding path program 1 times [2019-10-13 21:25:01,076 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:01,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180627941] [2019-10-13 21:25:01,076 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:01,077 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:01,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:01,263 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:01,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180627941] [2019-10-13 21:25:01,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:01,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:01,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429192309] [2019-10-13 21:25:01,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:01,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:01,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:01,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:01,267 INFO L87 Difference]: Start difference. First operand 230 states and 320 transitions. Second operand 4 states. [2019-10-13 21:25:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:01,355 INFO L93 Difference]: Finished difference Result 442 states and 628 transitions. [2019-10-13 21:25:01,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:01,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-10-13 21:25:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:01,363 INFO L225 Difference]: With dead ends: 442 [2019-10-13 21:25:01,364 INFO L226 Difference]: Without dead ends: 234 [2019-10-13 21:25:01,369 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:01,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-13 21:25:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2019-10-13 21:25:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-10-13 21:25:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 323 transitions. [2019-10-13 21:25:01,416 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 323 transitions. Word has length 76 [2019-10-13 21:25:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:01,417 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 323 transitions. [2019-10-13 21:25:01,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 323 transitions. [2019-10-13 21:25:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:25:01,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:01,427 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:01,427 INFO L410 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash 607799179, now seen corresponding path program 1 times [2019-10-13 21:25:01,428 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:01,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253972243] [2019-10-13 21:25:01,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:01,429 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:01,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:01,590 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:01,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253972243] [2019-10-13 21:25:01,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:01,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:01,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455476192] [2019-10-13 21:25:01,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:01,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:01,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:01,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:01,593 INFO L87 Difference]: Start difference. First operand 234 states and 323 transitions. Second operand 7 states. [2019-10-13 21:25:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:02,955 INFO L93 Difference]: Finished difference Result 533 states and 738 transitions. [2019-10-13 21:25:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:02,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-13 21:25:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:02,961 INFO L225 Difference]: With dead ends: 533 [2019-10-13 21:25:02,962 INFO L226 Difference]: Without dead ends: 321 [2019-10-13 21:25:02,963 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:02,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-10-13 21:25:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 320. [2019-10-13 21:25:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-13 21:25:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 435 transitions. [2019-10-13 21:25:03,016 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 435 transitions. Word has length 94 [2019-10-13 21:25:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:03,017 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 435 transitions. [2019-10-13 21:25:03,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 435 transitions. [2019-10-13 21:25:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:25:03,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:03,021 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:03,021 INFO L410 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:03,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1371679745, now seen corresponding path program 1 times [2019-10-13 21:25:03,022 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:03,022 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414321157] [2019-10-13 21:25:03,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:03,023 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:03,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:03,146 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:03,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414321157] [2019-10-13 21:25:03,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:03,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:03,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354566115] [2019-10-13 21:25:03,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:03,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:03,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:03,149 INFO L87 Difference]: Start difference. First operand 320 states and 435 transitions. Second operand 7 states. [2019-10-13 21:25:04,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:04,288 INFO L93 Difference]: Finished difference Result 539 states and 746 transitions. [2019-10-13 21:25:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 21:25:04,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:25:04,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:04,293 INFO L225 Difference]: With dead ends: 539 [2019-10-13 21:25:04,293 INFO L226 Difference]: Without dead ends: 324 [2019-10-13 21:25:04,296 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:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-13 21:25:04,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2019-10-13 21:25:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-10-13 21:25:04,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 435 transitions. [2019-10-13 21:25:04,343 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 435 transitions. Word has length 95 [2019-10-13 21:25:04,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:04,344 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 435 transitions. [2019-10-13 21:25:04,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 435 transitions. [2019-10-13 21:25:04,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:25:04,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:04,347 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:04,347 INFO L410 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:04,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:04,347 INFO L82 PathProgramCache]: Analyzing trace with hash 141577624, now seen corresponding path program 1 times [2019-10-13 21:25:04,348 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:04,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776716554] [2019-10-13 21:25:04,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,348 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:04,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776716554] [2019-10-13 21:25:04,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:04,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:04,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243923239] [2019-10-13 21:25:04,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:04,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:04,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:04,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:04,487 INFO L87 Difference]: Start difference. First operand 320 states and 435 transitions. Second operand 3 states. [2019-10-13 21:25:04,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:04,544 INFO L93 Difference]: Finished difference Result 767 states and 1066 transitions. [2019-10-13 21:25:04,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:04,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-13 21:25:04,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:04,552 INFO L225 Difference]: With dead ends: 767 [2019-10-13 21:25:04,552 INFO L226 Difference]: Without dead ends: 552 [2019-10-13 21:25:04,554 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:04,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-10-13 21:25:04,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 534. [2019-10-13 21:25:04,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-13 21:25:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 738 transitions. [2019-10-13 21:25:04,621 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 738 transitions. Word has length 96 [2019-10-13 21:25:04,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:04,622 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 738 transitions. [2019-10-13 21:25:04,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 738 transitions. [2019-10-13 21:25:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:25:04,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:04,632 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:04,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:04,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:04,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1335466069, now seen corresponding path program 1 times [2019-10-13 21:25:04,633 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:04,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823858831] [2019-10-13 21:25:04,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,634 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:04,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823858831] [2019-10-13 21:25:04,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:04,737 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:04,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110738053] [2019-10-13 21:25:04,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:04,739 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:04,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:04,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:04,741 INFO L87 Difference]: Start difference. First operand 534 states and 738 transitions. Second operand 3 states. [2019-10-13 21:25:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:04,814 INFO L93 Difference]: Finished difference Result 1269 states and 1795 transitions. [2019-10-13 21:25:04,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:04,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-13 21:25:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:04,823 INFO L225 Difference]: With dead ends: 1269 [2019-10-13 21:25:04,823 INFO L226 Difference]: Without dead ends: 883 [2019-10-13 21:25:04,827 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:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-10-13 21:25:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 877. [2019-10-13 21:25:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-10-13 21:25:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1230 transitions. [2019-10-13 21:25:04,912 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1230 transitions. Word has length 97 [2019-10-13 21:25:04,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:04,913 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1230 transitions. [2019-10-13 21:25:04,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1230 transitions. [2019-10-13 21:25:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:25:04,916 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:04,916 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:04,916 INFO L410 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2036530647, now seen corresponding path program 1 times [2019-10-13 21:25:04,917 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:04,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527930897] [2019-10-13 21:25:04,917 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,918 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:04,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:05,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:05,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527930897] [2019-10-13 21:25:05,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:05,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:05,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384646848] [2019-10-13 21:25:05,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:05,048 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:05,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:05,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:05,049 INFO L87 Difference]: Start difference. First operand 877 states and 1230 transitions. Second operand 3 states. [2019-10-13 21:25:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:05,107 INFO L93 Difference]: Finished difference Result 1479 states and 2087 transitions. [2019-10-13 21:25:05,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:05,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-13 21:25:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:05,113 INFO L225 Difference]: With dead ends: 1479 [2019-10-13 21:25:05,113 INFO L226 Difference]: Without dead ends: 718 [2019-10-13 21:25:05,117 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:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-10-13 21:25:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2019-10-13 21:25:05,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-10-13 21:25:05,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 998 transitions. [2019-10-13 21:25:05,164 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 998 transitions. Word has length 97 [2019-10-13 21:25:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:05,165 INFO L462 AbstractCegarLoop]: Abstraction has 718 states and 998 transitions. [2019-10-13 21:25:05,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 998 transitions. [2019-10-13 21:25:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:25:05,168 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:05,168 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:05,168 INFO L410 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:05,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:05,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2127297953, now seen corresponding path program 1 times [2019-10-13 21:25:05,169 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:05,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526353951] [2019-10-13 21:25:05,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:05,170 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:05,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:05,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526353951] [2019-10-13 21:25:05,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:05,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:05,282 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136444038] [2019-10-13 21:25:05,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:05,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:05,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:05,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:05,284 INFO L87 Difference]: Start difference. First operand 718 states and 998 transitions. Second operand 4 states. [2019-10-13 21:25:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:05,353 INFO L93 Difference]: Finished difference Result 1300 states and 1833 transitions. [2019-10-13 21:25:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:05,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-13 21:25:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:05,359 INFO L225 Difference]: With dead ends: 1300 [2019-10-13 21:25:05,359 INFO L226 Difference]: Without dead ends: 733 [2019-10-13 21:25:05,362 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:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-10-13 21:25:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2019-10-13 21:25:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-10-13 21:25:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1010 transitions. [2019-10-13 21:25:05,410 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1010 transitions. Word has length 97 [2019-10-13 21:25:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:05,411 INFO L462 AbstractCegarLoop]: Abstraction has 733 states and 1010 transitions. [2019-10-13 21:25:05,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1010 transitions. [2019-10-13 21:25:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 21:25:05,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:05,413 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:05,413 INFO L410 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash 344185535, now seen corresponding path program 1 times [2019-10-13 21:25:05,414 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:05,414 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771532138] [2019-10-13 21:25:05,414 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:05,415 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:05,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:05,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771532138] [2019-10-13 21:25:05,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:05,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:05,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679522108] [2019-10-13 21:25:05,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:05,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:05,539 INFO L87 Difference]: Start difference. First operand 733 states and 1010 transitions. Second operand 4 states. [2019-10-13 21:25:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:05,641 INFO L93 Difference]: Finished difference Result 1330 states and 1866 transitions. [2019-10-13 21:25:05,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:05,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-10-13 21:25:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:05,650 INFO L225 Difference]: With dead ends: 1330 [2019-10-13 21:25:05,650 INFO L226 Difference]: Without dead ends: 748 [2019-10-13 21:25:05,655 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:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-10-13 21:25:05,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-10-13 21:25:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-10-13 21:25:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1022 transitions. [2019-10-13 21:25:05,705 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1022 transitions. Word has length 105 [2019-10-13 21:25:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:05,705 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1022 transitions. [2019-10-13 21:25:05,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1022 transitions. [2019-10-13 21:25:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:25:05,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:05,709 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:05,709 INFO L410 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:05,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:05,709 INFO L82 PathProgramCache]: Analyzing trace with hash -325164599, now seen corresponding path program 1 times [2019-10-13 21:25:05,710 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:05,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570877085] [2019-10-13 21:25:05,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:05,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:05,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:05,867 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:05,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570877085] [2019-10-13 21:25:05,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:05,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:05,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488404615] [2019-10-13 21:25:05,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:05,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:05,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:05,871 INFO L87 Difference]: Start difference. First operand 748 states and 1022 transitions. Second operand 4 states. [2019-10-13 21:25:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:05,945 INFO L93 Difference]: Finished difference Result 1357 states and 1878 transitions. [2019-10-13 21:25:05,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:05,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:25:05,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:05,951 INFO L225 Difference]: With dead ends: 1357 [2019-10-13 21:25:05,952 INFO L226 Difference]: Without dead ends: 760 [2019-10-13 21:25:05,959 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:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-10-13 21:25:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 760. [2019-10-13 21:25:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-10-13 21:25:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1031 transitions. [2019-10-13 21:25:06,012 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1031 transitions. Word has length 113 [2019-10-13 21:25:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:06,012 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 1031 transitions. [2019-10-13 21:25:06,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1031 transitions. [2019-10-13 21:25:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:25:06,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:06,016 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:06,017 INFO L410 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash -201213723, now seen corresponding path program 1 times [2019-10-13 21:25:06,017 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:06,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116767176] [2019-10-13 21:25:06,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:25:06,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116767176] [2019-10-13 21:25:06,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:06,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:06,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540846623] [2019-10-13 21:25:06,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:06,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:06,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:06,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:06,137 INFO L87 Difference]: Start difference. First operand 760 states and 1031 transitions. Second operand 4 states. [2019-10-13 21:25:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:06,213 INFO L93 Difference]: Finished difference Result 1384 states and 1908 transitions. [2019-10-13 21:25:06,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:06,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:25:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:06,220 INFO L225 Difference]: With dead ends: 1384 [2019-10-13 21:25:06,220 INFO L226 Difference]: Without dead ends: 775 [2019-10-13 21:25:06,223 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:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-10-13 21:25:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2019-10-13 21:25:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-10-13 21:25:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1043 transitions. [2019-10-13 21:25:06,271 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1043 transitions. Word has length 113 [2019-10-13 21:25:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:06,271 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1043 transitions. [2019-10-13 21:25:06,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1043 transitions. [2019-10-13 21:25:06,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:25:06,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:06,275 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:06,276 INFO L410 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:06,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:06,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1920752919, now seen corresponding path program 1 times [2019-10-13 21:25:06,276 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:06,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727350230] [2019-10-13 21:25:06,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:06,404 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:06,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727350230] [2019-10-13 21:25:06,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:06,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:06,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301556589] [2019-10-13 21:25:06,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:06,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:06,406 INFO L87 Difference]: Start difference. First operand 775 states and 1043 transitions. Second operand 4 states. [2019-10-13 21:25:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:06,475 INFO L93 Difference]: Finished difference Result 1417 states and 1929 transitions. [2019-10-13 21:25:06,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:06,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-10-13 21:25:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:06,483 INFO L225 Difference]: With dead ends: 1417 [2019-10-13 21:25:06,483 INFO L226 Difference]: Without dead ends: 793 [2019-10-13 21:25:06,487 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:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2019-10-13 21:25:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 793. [2019-10-13 21:25:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2019-10-13 21:25:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1058 transitions. [2019-10-13 21:25:06,531 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1058 transitions. Word has length 121 [2019-10-13 21:25:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:06,534 INFO L462 AbstractCegarLoop]: Abstraction has 793 states and 1058 transitions. [2019-10-13 21:25:06,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:06,534 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1058 transitions. [2019-10-13 21:25:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 21:25:06,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:06,537 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:06,538 INFO L410 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:06,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:06,538 INFO L82 PathProgramCache]: Analyzing trace with hash 934778704, now seen corresponding path program 1 times [2019-10-13 21:25:06,538 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:06,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375484450] [2019-10-13 21:25:06,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,539 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:06,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:06,817 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:06,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375484450] [2019-10-13 21:25:06,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:06,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:25:06,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4749553] [2019-10-13 21:25:06,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:25:06,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:06,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:25:06,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:25:06,821 INFO L87 Difference]: Start difference. First operand 793 states and 1058 transitions. Second operand 10 states. [2019-10-13 21:25:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:09,757 INFO L93 Difference]: Finished difference Result 2073 states and 2746 transitions. [2019-10-13 21:25:09,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:25:09,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2019-10-13 21:25:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:09,767 INFO L225 Difference]: With dead ends: 2073 [2019-10-13 21:25:09,767 INFO L226 Difference]: Without dead ends: 1422 [2019-10-13 21:25:09,770 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:09,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2019-10-13 21:25:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1325. [2019-10-13 21:25:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1325 states. [2019-10-13 21:25:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 1736 transitions. [2019-10-13 21:25:09,854 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 1736 transitions. Word has length 126 [2019-10-13 21:25:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:09,854 INFO L462 AbstractCegarLoop]: Abstraction has 1325 states and 1736 transitions. [2019-10-13 21:25:09,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:25:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 1736 transitions. [2019-10-13 21:25:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:25:09,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:09,857 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:09,858 INFO L410 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1043125097, now seen corresponding path program 1 times [2019-10-13 21:25:09,859 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:09,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618831479] [2019-10-13 21:25:09,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:09,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:09,944 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:09,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618831479] [2019-10-13 21:25:09,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:09,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:09,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291407448] [2019-10-13 21:25:09,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:09,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:09,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:09,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:09,947 INFO L87 Difference]: Start difference. First operand 1325 states and 1736 transitions. Second operand 4 states. [2019-10-13 21:25:10,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:10,034 INFO L93 Difference]: Finished difference Result 2408 states and 3177 transitions. [2019-10-13 21:25:10,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:10,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-10-13 21:25:10,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:10,043 INFO L225 Difference]: With dead ends: 2408 [2019-10-13 21:25:10,044 INFO L226 Difference]: Without dead ends: 1337 [2019-10-13 21:25:10,049 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:10,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-10-13 21:25:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1331. [2019-10-13 21:25:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1331 states. [2019-10-13 21:25:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 1723 transitions. [2019-10-13 21:25:10,148 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 1723 transitions. Word has length 128 [2019-10-13 21:25:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:10,148 INFO L462 AbstractCegarLoop]: Abstraction has 1331 states and 1723 transitions. [2019-10-13 21:25:10,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 1723 transitions. [2019-10-13 21:25:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 21:25:10,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:10,153 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:10,154 INFO L410 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:10,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:10,154 INFO L82 PathProgramCache]: Analyzing trace with hash -580362228, now seen corresponding path program 1 times [2019-10-13 21:25:10,155 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:10,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058790130] [2019-10-13 21:25:10,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:10,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:10,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:10,333 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:10,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058790130] [2019-10-13 21:25:10,333 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:10,333 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:10,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884529530] [2019-10-13 21:25:10,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:10,334 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:10,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:10,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:10,335 INFO L87 Difference]: Start difference. First operand 1331 states and 1723 transitions. Second operand 9 states. [2019-10-13 21:25:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:12,597 INFO L93 Difference]: Finished difference Result 2743 states and 3525 transitions. [2019-10-13 21:25:12,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:25:12,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2019-10-13 21:25:12,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:12,608 INFO L225 Difference]: With dead ends: 2743 [2019-10-13 21:25:12,608 INFO L226 Difference]: Without dead ends: 1717 [2019-10-13 21:25:12,612 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:12,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2019-10-13 21:25:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1454. [2019-10-13 21:25:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-10-13 21:25:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1857 transitions. [2019-10-13 21:25:12,699 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1857 transitions. Word has length 130 [2019-10-13 21:25:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:12,699 INFO L462 AbstractCegarLoop]: Abstraction has 1454 states and 1857 transitions. [2019-10-13 21:25:12,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1857 transitions. [2019-10-13 21:25:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-13 21:25:12,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:12,702 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:12,702 INFO L410 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:12,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:12,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1422012878, now seen corresponding path program 1 times [2019-10-13 21:25:12,703 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:12,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134580861] [2019-10-13 21:25:12,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:12,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:12,824 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:12,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134580861] [2019-10-13 21:25:12,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:12,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:25:12,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715366949] [2019-10-13 21:25:12,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:25:12,826 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:12,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:25:12,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:25:12,826 INFO L87 Difference]: Start difference. First operand 1454 states and 1857 transitions. Second operand 7 states. [2019-10-13 21:25:12,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:12,940 INFO L93 Difference]: Finished difference Result 1555 states and 2000 transitions. [2019-10-13 21:25:12,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:25:12,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-10-13 21:25:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:12,951 INFO L225 Difference]: With dead ends: 1555 [2019-10-13 21:25:12,951 INFO L226 Difference]: Without dead ends: 1553 [2019-10-13 21:25:12,953 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2019-10-13 21:25:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1475. [2019-10-13 21:25:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2019-10-13 21:25:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1880 transitions. [2019-10-13 21:25:13,036 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1880 transitions. Word has length 129 [2019-10-13 21:25:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:13,037 INFO L462 AbstractCegarLoop]: Abstraction has 1475 states and 1880 transitions. [2019-10-13 21:25:13,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:25:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1880 transitions. [2019-10-13 21:25:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-13 21:25:13,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:13,040 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:13,040 INFO L410 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:13,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1958552652, now seen corresponding path program 1 times [2019-10-13 21:25:13,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:13,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006129000] [2019-10-13 21:25:13,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:13,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:13,247 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:13,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006129000] [2019-10-13 21:25:13,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:13,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:25:13,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190596216] [2019-10-13 21:25:13,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:25:13,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:13,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:25:13,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:25:13,250 INFO L87 Difference]: Start difference. First operand 1475 states and 1880 transitions. Second operand 10 states. [2019-10-13 21:25:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:16,581 INFO L93 Difference]: Finished difference Result 3875 states and 4917 transitions. [2019-10-13 21:25:16,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 21:25:16,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 134 [2019-10-13 21:25:16,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:16,597 INFO L225 Difference]: With dead ends: 3875 [2019-10-13 21:25:16,597 INFO L226 Difference]: Without dead ends: 2747 [2019-10-13 21:25:16,602 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:16,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2019-10-13 21:25:16,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 1900. [2019-10-13 21:25:16,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-10-13 21:25:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2410 transitions. [2019-10-13 21:25:16,733 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2410 transitions. Word has length 134 [2019-10-13 21:25:16,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:16,733 INFO L462 AbstractCegarLoop]: Abstraction has 1900 states and 2410 transitions. [2019-10-13 21:25:16,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:25:16,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2410 transitions. [2019-10-13 21:25:16,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:25:16,736 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:16,736 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:25:16,736 INFO L410 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:16,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:16,737 INFO L82 PathProgramCache]: Analyzing trace with hash -2040574201, now seen corresponding path program 1 times [2019-10-13 21:25:16,737 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:16,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848188866] [2019-10-13 21:25:16,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:16,738 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:16,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:16,856 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:16,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848188866] [2019-10-13 21:25:16,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:16,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:16,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141205292] [2019-10-13 21:25:16,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:16,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:16,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:16,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:16,859 INFO L87 Difference]: Start difference. First operand 1900 states and 2410 transitions. Second operand 5 states. [2019-10-13 21:25:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:17,396 INFO L93 Difference]: Finished difference Result 6574 states and 8450 transitions. [2019-10-13 21:25:17,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:17,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-13 21:25:17,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:17,428 INFO L225 Difference]: With dead ends: 6574 [2019-10-13 21:25:17,429 INFO L226 Difference]: Without dead ends: 4966 [2019-10-13 21:25:17,438 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:17,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4966 states. [2019-10-13 21:25:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4966 to 4508. [2019-10-13 21:25:17,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-10-13 21:25:17,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 5738 transitions. [2019-10-13 21:25:17,932 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 5738 transitions. Word has length 135 [2019-10-13 21:25:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:17,933 INFO L462 AbstractCegarLoop]: Abstraction has 4508 states and 5738 transitions. [2019-10-13 21:25:17,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 5738 transitions. [2019-10-13 21:25:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:25:17,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:17,940 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:17,941 INFO L410 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1055165671, now seen corresponding path program 1 times [2019-10-13 21:25:17,942 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:17,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246365668] [2019-10-13 21:25:17,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:17,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:18,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246365668] [2019-10-13 21:25:18,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:18,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:25:18,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463586146] [2019-10-13 21:25:18,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:25:18,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:25:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:25:18,119 INFO L87 Difference]: Start difference. First operand 4508 states and 5738 transitions. Second operand 4 states. [2019-10-13 21:25:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:18,675 INFO L93 Difference]: Finished difference Result 8468 states and 10813 transitions. [2019-10-13 21:25:18,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:25:18,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:25:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:18,703 INFO L225 Difference]: With dead ends: 8468 [2019-10-13 21:25:18,703 INFO L226 Difference]: Without dead ends: 4549 [2019-10-13 21:25:18,720 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:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2019-10-13 21:25:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4126. [2019-10-13 21:25:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4126 states. [2019-10-13 21:25:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 5253 transitions. [2019-10-13 21:25:18,982 INFO L78 Accepts]: Start accepts. Automaton has 4126 states and 5253 transitions. Word has length 139 [2019-10-13 21:25:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:18,984 INFO L462 AbstractCegarLoop]: Abstraction has 4126 states and 5253 transitions. [2019-10-13 21:25:18,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:25:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 4126 states and 5253 transitions. [2019-10-13 21:25:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:25:18,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:18,990 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:18,990 INFO L410 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:18,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1098266395, now seen corresponding path program 1 times [2019-10-13 21:25:18,991 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:18,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400961611] [2019-10-13 21:25:18,991 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,992 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:18,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:19,205 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:19,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400961611] [2019-10-13 21:25:19,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:19,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:19,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181547985] [2019-10-13 21:25:19,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:19,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:19,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:19,208 INFO L87 Difference]: Start difference. First operand 4126 states and 5253 transitions. Second operand 9 states. [2019-10-13 21:25:20,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:20,721 INFO L93 Difference]: Finished difference Result 7560 states and 9692 transitions. [2019-10-13 21:25:20,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:25:20,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2019-10-13 21:25:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:20,753 INFO L225 Difference]: With dead ends: 7560 [2019-10-13 21:25:20,753 INFO L226 Difference]: Without dead ends: 3845 [2019-10-13 21:25:20,766 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:25:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2019-10-13 21:25:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3486. [2019-10-13 21:25:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3486 states. [2019-10-13 21:25:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4428 transitions. [2019-10-13 21:25:20,979 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4428 transitions. Word has length 136 [2019-10-13 21:25:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:20,979 INFO L462 AbstractCegarLoop]: Abstraction has 3486 states and 4428 transitions. [2019-10-13 21:25:20,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4428 transitions. [2019-10-13 21:25:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:25:20,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:20,982 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:20,983 INFO L410 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:20,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1626245539, now seen corresponding path program 1 times [2019-10-13 21:25:20,983 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:20,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354185197] [2019-10-13 21:25:20,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:20,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:21,134 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:21,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354185197] [2019-10-13 21:25:21,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:21,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:25:21,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168346565] [2019-10-13 21:25:21,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:25:21,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:25:21,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:25:21,140 INFO L87 Difference]: Start difference. First operand 3486 states and 4428 transitions. Second operand 9 states. [2019-10-13 21:25:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:22,784 INFO L93 Difference]: Finished difference Result 7084 states and 9147 transitions. [2019-10-13 21:25:22,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:25:22,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2019-10-13 21:25:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:22,804 INFO L225 Difference]: With dead ends: 7084 [2019-10-13 21:25:22,804 INFO L226 Difference]: Without dead ends: 3948 [2019-10-13 21:25:22,817 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:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3948 states. [2019-10-13 21:25:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3948 to 3385. [2019-10-13 21:25:23,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3385 states. [2019-10-13 21:25:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 4299 transitions. [2019-10-13 21:25:23,035 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 4299 transitions. Word has length 137 [2019-10-13 21:25:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:23,035 INFO L462 AbstractCegarLoop]: Abstraction has 3385 states and 4299 transitions. [2019-10-13 21:25:23,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:25:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 4299 transitions. [2019-10-13 21:25:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:25:23,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:23,038 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:23,039 INFO L410 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1745306833, now seen corresponding path program 1 times [2019-10-13 21:25:23,039 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:23,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815354210] [2019-10-13 21:25:23,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,040 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:23,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:23,119 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:23,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815354210] [2019-10-13 21:25:23,119 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:23,119 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:23,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706401207] [2019-10-13 21:25:23,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:23,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:23,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:23,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:23,122 INFO L87 Difference]: Start difference. First operand 3385 states and 4299 transitions. Second operand 5 states. [2019-10-13 21:25:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:23,777 INFO L93 Difference]: Finished difference Result 10429 states and 13371 transitions. [2019-10-13 21:25:23,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:23,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-13 21:25:23,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:23,813 INFO L225 Difference]: With dead ends: 10429 [2019-10-13 21:25:23,813 INFO L226 Difference]: Without dead ends: 7553 [2019-10-13 21:25:23,823 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:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7553 states. [2019-10-13 21:25:24,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7553 to 5192. [2019-10-13 21:25:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5192 states. [2019-10-13 21:25:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5192 states to 5192 states and 6585 transitions. [2019-10-13 21:25:24,187 INFO L78 Accepts]: Start accepts. Automaton has 5192 states and 6585 transitions. Word has length 138 [2019-10-13 21:25:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:24,188 INFO L462 AbstractCegarLoop]: Abstraction has 5192 states and 6585 transitions. [2019-10-13 21:25:24,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:24,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5192 states and 6585 transitions. [2019-10-13 21:25:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:25:24,191 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:24,192 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:24,192 INFO L410 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:24,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:24,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1474814422, now seen corresponding path program 1 times [2019-10-13 21:25:24,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:24,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313194019] [2019-10-13 21:25:24,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,193 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:24,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:24,292 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:24,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313194019] [2019-10-13 21:25:24,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:24,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:25:24,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809935266] [2019-10-13 21:25:24,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:25:24,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:24,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:25:24,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:25:24,297 INFO L87 Difference]: Start difference. First operand 5192 states and 6585 transitions. Second operand 5 states. [2019-10-13 21:25:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:24,964 INFO L93 Difference]: Finished difference Result 12052 states and 15352 transitions. [2019-10-13 21:25:24,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:25:24,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-13 21:25:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:24,992 INFO L225 Difference]: With dead ends: 12052 [2019-10-13 21:25:24,992 INFO L226 Difference]: Without dead ends: 7504 [2019-10-13 21:25:25,004 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:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7504 states. [2019-10-13 21:25:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7504 to 6956. [2019-10-13 21:25:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6956 states. [2019-10-13 21:25:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6956 states to 6956 states and 8776 transitions. [2019-10-13 21:25:25,351 INFO L78 Accepts]: Start accepts. Automaton has 6956 states and 8776 transitions. Word has length 138 [2019-10-13 21:25:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:25,351 INFO L462 AbstractCegarLoop]: Abstraction has 6956 states and 8776 transitions. [2019-10-13 21:25:25,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:25:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 6956 states and 8776 transitions. [2019-10-13 21:25:25,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:25:25,355 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:25,356 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:25,356 INFO L410 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash -831933549, now seen corresponding path program 1 times [2019-10-13 21:25:25,356 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:25,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20467029] [2019-10-13 21:25:25,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,357 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:25,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:25,408 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:25,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20467029] [2019-10-13 21:25:25,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:25,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:25:25,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755752922] [2019-10-13 21:25:25,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:25:25,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:25,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:25:25,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:25:25,410 INFO L87 Difference]: Start difference. First operand 6956 states and 8776 transitions. Second operand 3 states. [2019-10-13 21:25:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:25:26,006 INFO L93 Difference]: Finished difference Result 13401 states and 16983 transitions. [2019-10-13 21:25:26,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:25:26,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-13 21:25:26,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:25:26,034 INFO L225 Difference]: With dead ends: 13401 [2019-10-13 21:25:26,035 INFO L226 Difference]: Without dead ends: 7025 [2019-10-13 21:25:26,050 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:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7025 states. [2019-10-13 21:25:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7025 to 6962. [2019-10-13 21:25:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6962 states. [2019-10-13 21:25:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6962 states to 6962 states and 8782 transitions. [2019-10-13 21:25:26,525 INFO L78 Accepts]: Start accepts. Automaton has 6962 states and 8782 transitions. Word has length 139 [2019-10-13 21:25:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:25:26,525 INFO L462 AbstractCegarLoop]: Abstraction has 6962 states and 8782 transitions. [2019-10-13 21:25:26,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:25:26,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6962 states and 8782 transitions. [2019-10-13 21:25:26,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:25:26,530 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:25:26,530 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:26,530 INFO L410 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:25:26,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:25:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1719336114, now seen corresponding path program 1 times [2019-10-13 21:25:26,531 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:25:26,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250352262] [2019-10-13 21:25:26,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:26,531 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:25:26,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:25:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:25:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-13 21:25:26,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250352262] [2019-10-13 21:25:26,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:25:26,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:25:26,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469647889] [2019-10-13 21:25:26,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:25:26,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:25:26,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:25:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:25:26,931 INFO L87 Difference]: Start difference. First operand 6962 states and 8782 transitions. Second operand 12 states.