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/systemc/token_ring.06.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:29:36,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:29:36,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:29:36,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:29:36,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:29:36,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:29:36,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:29:36,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:29:36,618 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:29:36,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:29:36,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:29:36,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:29:36,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:29:36,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:29:36,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:29:36,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:29:36,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:29:36,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:29:36,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:29:36,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:29:36,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:29:36,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:29:36,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:29:36,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:29:36,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:29:36,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:29:36,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:29:36,656 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:29:36,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:29:36,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:29:36,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:29:36,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:29:36,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:29:36,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:29:36,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:29:36,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:29:36,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:29:36,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:29:36,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:29:36,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:29:36,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:29:36,668 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:29:36,701 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:29:36,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:29:36,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:29:36,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:29:36,704 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:29:36,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:29:36,705 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:29:36,705 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:29:36,705 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:29:36,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:29:36,706 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:29:36,706 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:29:36,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:29:36,707 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:29:36,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:29:36,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:29:36,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:29:36,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:29:36,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:29:36,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:29:36,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:29:36,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:29:36,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:29:36,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:29:36,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:29:36,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:29:36,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:29:36,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:29:36,711 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:29:37,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:29:37,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:29:37,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:29:37,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:29:37,025 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:29:37,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.06.cil-1.c [2019-10-13 21:29:37,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e66f82c5/226e45d00fa647ee9288653f19c50a42/FLAGb6c578fdd [2019-10-13 21:29:37,578 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:29:37,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.06.cil-1.c [2019-10-13 21:29:37,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e66f82c5/226e45d00fa647ee9288653f19c50a42/FLAGb6c578fdd [2019-10-13 21:29:37,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e66f82c5/226e45d00fa647ee9288653f19c50a42 [2019-10-13 21:29:37,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:29:37,971 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:29:37,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:37,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:29:37,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:29:37,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:37" (1/1) ... [2019-10-13 21:29:37,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9b8ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:37, skipping insertion in model container [2019-10-13 21:29:37,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:29:37" (1/1) ... [2019-10-13 21:29:37,988 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:29:38,049 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:29:38,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:38,375 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:29:38,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:29:38,609 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:29:38,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38 WrapperNode [2019-10-13 21:29:38,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:29:38,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:29:38,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:29:38,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:29:38,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38" (1/1) ... [2019-10-13 21:29:38,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38" (1/1) ... [2019-10-13 21:29:38,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38" (1/1) ... [2019-10-13 21:29:38,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38" (1/1) ... [2019-10-13 21:29:38,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38" (1/1) ... [2019-10-13 21:29:38,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38" (1/1) ... [2019-10-13 21:29:38,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38" (1/1) ... [2019-10-13 21:29:38,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:29:38,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:29:38,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:29:38,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:29:38,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38" (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:29:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:29:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:29:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-13 21:29:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-13 21:29:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-13 21:29:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-13 21:29:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-13 21:29:38,762 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-13 21:29:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-10-13 21:29:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-10-13 21:29:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-13 21:29:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-13 21:29:38,763 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-13 21:29:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-13 21:29:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-13 21:29:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-10-13 21:29:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-10-13 21:29:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-13 21:29:38,764 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-13 21:29:38,765 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-13 21:29:38,765 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-13 21:29:38,765 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-13 21:29:38,765 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-13 21:29:38,765 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-13 21:29:38,765 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-13 21:29:38,766 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-13 21:29:38,766 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-13 21:29:38,766 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-13 21:29:38,766 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-13 21:29:38,766 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-13 21:29:38,766 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:29:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:29:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-13 21:29:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-13 21:29:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-13 21:29:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-13 21:29:38,767 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-13 21:29:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-13 21:29:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-10-13 21:29:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-10-13 21:29:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-13 21:29:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:29:38,768 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-13 21:29:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-13 21:29:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-13 21:29:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-13 21:29:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-13 21:29:38,769 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-10-13 21:29:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-10-13 21:29:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-13 21:29:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-13 21:29:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-13 21:29:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-13 21:29:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-13 21:29:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-13 21:29:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-13 21:29:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-13 21:29:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-13 21:29:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-13 21:29:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-13 21:29:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-13 21:29:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:29:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:29:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:29:39,690 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:29:39,691 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-13 21:29:39,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:39 BoogieIcfgContainer [2019-10-13 21:29:39,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:29:39,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:29:39,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:29:39,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:29:39,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:29:37" (1/3) ... [2019-10-13 21:29:39,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e79950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:39, skipping insertion in model container [2019-10-13 21:29:39,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:29:38" (2/3) ... [2019-10-13 21:29:39,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e79950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:29:39, skipping insertion in model container [2019-10-13 21:29:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:29:39" (3/3) ... [2019-10-13 21:29:39,704 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-1.c [2019-10-13 21:29:39,714 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:29:39,733 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:29:39,749 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:29:39,788 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:29:39,788 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:29:39,788 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:29:39,789 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:29:39,789 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:29:39,789 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:29:39,789 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:29:39,789 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:29:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states. [2019-10-13 21:29:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:39,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:39,834 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:39,836 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:39,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1698100173, now seen corresponding path program 1 times [2019-10-13 21:29:39,850 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:39,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056663662] [2019-10-13 21:29:39,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:39,851 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:39,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:40,353 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:29:40,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056663662] [2019-10-13 21:29:40,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:40,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:40,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708232786] [2019-10-13 21:29:40,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:40,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:40,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:40,380 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 5 states. [2019-10-13 21:29:41,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:41,387 INFO L93 Difference]: Finished difference Result 627 states and 965 transitions. [2019-10-13 21:29:41,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:41,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:41,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:41,407 INFO L225 Difference]: With dead ends: 627 [2019-10-13 21:29:41,407 INFO L226 Difference]: Without dead ends: 338 [2019-10-13 21:29:41,414 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:41,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-13 21:29:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 292. [2019-10-13 21:29:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:41,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 418 transitions. [2019-10-13 21:29:41,499 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 418 transitions. Word has length 148 [2019-10-13 21:29:41,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:41,500 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 418 transitions. [2019-10-13 21:29:41,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 418 transitions. [2019-10-13 21:29:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:41,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:41,505 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:41,506 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash -352308725, now seen corresponding path program 1 times [2019-10-13 21:29:41,507 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:41,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283359121] [2019-10-13 21:29:41,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:41,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:41,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:41,683 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:29:41,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283359121] [2019-10-13 21:29:41,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:41,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:41,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055090445] [2019-10-13 21:29:41,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:41,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:41,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:41,691 INFO L87 Difference]: Start difference. First operand 292 states and 418 transitions. Second operand 5 states. [2019-10-13 21:29:42,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:42,439 INFO L93 Difference]: Finished difference Result 606 states and 890 transitions. [2019-10-13 21:29:42,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:42,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:42,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:42,444 INFO L225 Difference]: With dead ends: 606 [2019-10-13 21:29:42,444 INFO L226 Difference]: Without dead ends: 338 [2019-10-13 21:29:42,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-13 21:29:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 292. [2019-10-13 21:29:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 417 transitions. [2019-10-13 21:29:42,480 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 417 transitions. Word has length 148 [2019-10-13 21:29:42,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:42,480 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 417 transitions. [2019-10-13 21:29:42,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 417 transitions. [2019-10-13 21:29:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:42,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:42,484 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:42,484 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:42,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:42,485 INFO L82 PathProgramCache]: Analyzing trace with hash 135738381, now seen corresponding path program 1 times [2019-10-13 21:29:42,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:42,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872753875] [2019-10-13 21:29:42,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:42,486 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:42,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:42,705 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:29:42,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872753875] [2019-10-13 21:29:42,706 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:42,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:42,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677320495] [2019-10-13 21:29:42,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:42,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:42,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:42,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:42,709 INFO L87 Difference]: Start difference. First operand 292 states and 417 transitions. Second operand 5 states. [2019-10-13 21:29:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:43,418 INFO L93 Difference]: Finished difference Result 602 states and 880 transitions. [2019-10-13 21:29:43,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:43,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:43,422 INFO L225 Difference]: With dead ends: 602 [2019-10-13 21:29:43,423 INFO L226 Difference]: Without dead ends: 334 [2019-10-13 21:29:43,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-13 21:29:43,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 292. [2019-10-13 21:29:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 416 transitions. [2019-10-13 21:29:43,452 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 416 transitions. Word has length 148 [2019-10-13 21:29:43,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:43,453 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 416 transitions. [2019-10-13 21:29:43,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:43,453 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 416 transitions. [2019-10-13 21:29:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:43,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:43,456 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:43,456 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:43,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:43,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1146433905, now seen corresponding path program 1 times [2019-10-13 21:29:43,457 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:43,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412322939] [2019-10-13 21:29:43,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:43,458 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:43,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:43,546 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:29:43,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412322939] [2019-10-13 21:29:43,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:43,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:43,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695603641] [2019-10-13 21:29:43,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:43,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:43,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:43,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:43,549 INFO L87 Difference]: Start difference. First operand 292 states and 416 transitions. Second operand 5 states. [2019-10-13 21:29:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:44,213 INFO L93 Difference]: Finished difference Result 600 states and 874 transitions. [2019-10-13 21:29:44,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:44,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:44,218 INFO L225 Difference]: With dead ends: 600 [2019-10-13 21:29:44,219 INFO L226 Difference]: Without dead ends: 332 [2019-10-13 21:29:44,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:44,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-13 21:29:44,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 292. [2019-10-13 21:29:44,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 415 transitions. [2019-10-13 21:29:44,250 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 415 transitions. Word has length 148 [2019-10-13 21:29:44,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:44,250 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 415 transitions. [2019-10-13 21:29:44,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 415 transitions. [2019-10-13 21:29:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:44,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:44,253 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:44,253 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1306057677, now seen corresponding path program 1 times [2019-10-13 21:29:44,254 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:44,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965552465] [2019-10-13 21:29:44,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:44,255 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:44,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:44,371 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:29:44,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965552465] [2019-10-13 21:29:44,372 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:44,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:44,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048364747] [2019-10-13 21:29:44,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:44,373 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:44,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:44,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:44,374 INFO L87 Difference]: Start difference. First operand 292 states and 415 transitions. Second operand 5 states. [2019-10-13 21:29:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:45,012 INFO L93 Difference]: Finished difference Result 598 states and 868 transitions. [2019-10-13 21:29:45,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:45,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:45,016 INFO L225 Difference]: With dead ends: 598 [2019-10-13 21:29:45,016 INFO L226 Difference]: Without dead ends: 330 [2019-10-13 21:29:45,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:45,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-13 21:29:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 292. [2019-10-13 21:29:45,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 414 transitions. [2019-10-13 21:29:45,041 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 414 transitions. Word has length 148 [2019-10-13 21:29:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:45,041 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 414 transitions. [2019-10-13 21:29:45,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 414 transitions. [2019-10-13 21:29:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:45,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:45,046 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:45,047 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:45,048 INFO L82 PathProgramCache]: Analyzing trace with hash -415945009, now seen corresponding path program 1 times [2019-10-13 21:29:45,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:45,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461055165] [2019-10-13 21:29:45,048 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:45,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:45,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:45,141 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:29:45,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461055165] [2019-10-13 21:29:45,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:45,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:45,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654606185] [2019-10-13 21:29:45,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:45,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:45,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:45,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:45,146 INFO L87 Difference]: Start difference. First operand 292 states and 414 transitions. Second operand 5 states. [2019-10-13 21:29:45,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:45,727 INFO L93 Difference]: Finished difference Result 596 states and 862 transitions. [2019-10-13 21:29:45,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:45,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:45,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:45,731 INFO L225 Difference]: With dead ends: 596 [2019-10-13 21:29:45,731 INFO L226 Difference]: Without dead ends: 328 [2019-10-13 21:29:45,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:45,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-13 21:29:45,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 292. [2019-10-13 21:29:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 413 transitions. [2019-10-13 21:29:45,755 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 413 transitions. Word has length 148 [2019-10-13 21:29:45,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:45,755 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 413 transitions. [2019-10-13 21:29:45,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 413 transitions. [2019-10-13 21:29:45,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:45,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:45,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:45,758 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:45,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:45,759 INFO L82 PathProgramCache]: Analyzing trace with hash -748588147, now seen corresponding path program 1 times [2019-10-13 21:29:45,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:45,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048692121] [2019-10-13 21:29:45,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:45,759 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:45,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:45,834 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:29:45,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048692121] [2019-10-13 21:29:45,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:45,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:45,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954650742] [2019-10-13 21:29:45,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:45,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:45,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:45,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:45,837 INFO L87 Difference]: Start difference. First operand 292 states and 413 transitions. Second operand 5 states. [2019-10-13 21:29:46,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:46,453 INFO L93 Difference]: Finished difference Result 625 states and 912 transitions. [2019-10-13 21:29:46,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:46,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:46,457 INFO L225 Difference]: With dead ends: 625 [2019-10-13 21:29:46,457 INFO L226 Difference]: Without dead ends: 357 [2019-10-13 21:29:46,458 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-10-13 21:29:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 292. [2019-10-13 21:29:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 412 transitions. [2019-10-13 21:29:46,484 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 412 transitions. Word has length 148 [2019-10-13 21:29:46,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:46,484 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 412 transitions. [2019-10-13 21:29:46,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 412 transitions. [2019-10-13 21:29:46,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:46,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:46,487 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:46,487 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1180344079, now seen corresponding path program 1 times [2019-10-13 21:29:46,488 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:46,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663914093] [2019-10-13 21:29:46,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:46,488 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:46,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:46,568 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:29:46,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663914093] [2019-10-13 21:29:46,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:46,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:46,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494613996] [2019-10-13 21:29:46,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:46,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:46,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:46,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:46,572 INFO L87 Difference]: Start difference. First operand 292 states and 412 transitions. Second operand 5 states. [2019-10-13 21:29:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:47,138 INFO L93 Difference]: Finished difference Result 619 states and 901 transitions. [2019-10-13 21:29:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:47,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:47,142 INFO L225 Difference]: With dead ends: 619 [2019-10-13 21:29:47,142 INFO L226 Difference]: Without dead ends: 351 [2019-10-13 21:29:47,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-13 21:29:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 292. [2019-10-13 21:29:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:47,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 411 transitions. [2019-10-13 21:29:47,169 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 411 transitions. Word has length 148 [2019-10-13 21:29:47,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:47,169 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 411 transitions. [2019-10-13 21:29:47,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:47,169 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 411 transitions. [2019-10-13 21:29:47,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:47,172 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:47,172 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:47,172 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:47,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:47,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1112736947, now seen corresponding path program 1 times [2019-10-13 21:29:47,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:47,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633208586] [2019-10-13 21:29:47,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:47,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:47,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:47,261 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:29:47,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633208586] [2019-10-13 21:29:47,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:47,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:47,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178173994] [2019-10-13 21:29:47,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:47,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:47,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:47,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:47,264 INFO L87 Difference]: Start difference. First operand 292 states and 411 transitions. Second operand 5 states. [2019-10-13 21:29:47,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:47,904 INFO L93 Difference]: Finished difference Result 621 states and 900 transitions. [2019-10-13 21:29:47,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:47,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:47,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:47,909 INFO L225 Difference]: With dead ends: 621 [2019-10-13 21:29:47,909 INFO L226 Difference]: Without dead ends: 353 [2019-10-13 21:29:47,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-13 21:29:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 292. [2019-10-13 21:29:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 410 transitions. [2019-10-13 21:29:47,951 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 410 transitions. Word has length 148 [2019-10-13 21:29:47,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:47,952 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 410 transitions. [2019-10-13 21:29:47,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 410 transitions. [2019-10-13 21:29:47,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:47,954 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:47,954 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:47,955 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:47,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:47,955 INFO L82 PathProgramCache]: Analyzing trace with hash 614408015, now seen corresponding path program 1 times [2019-10-13 21:29:47,955 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:47,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474084911] [2019-10-13 21:29:47,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:47,956 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:47,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:48,039 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:29:48,040 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474084911] [2019-10-13 21:29:48,041 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:48,041 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:48,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153090290] [2019-10-13 21:29:48,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:48,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:48,043 INFO L87 Difference]: Start difference. First operand 292 states and 410 transitions. Second operand 5 states. [2019-10-13 21:29:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:48,701 INFO L93 Difference]: Finished difference Result 617 states and 890 transitions. [2019-10-13 21:29:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:48,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:48,704 INFO L225 Difference]: With dead ends: 617 [2019-10-13 21:29:48,704 INFO L226 Difference]: Without dead ends: 349 [2019-10-13 21:29:48,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:48,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-13 21:29:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 292. [2019-10-13 21:29:48,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 409 transitions. [2019-10-13 21:29:48,740 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 409 transitions. Word has length 148 [2019-10-13 21:29:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:48,740 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 409 transitions. [2019-10-13 21:29:48,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 409 transitions. [2019-10-13 21:29:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:48,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:48,743 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:48,743 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1032954927, now seen corresponding path program 1 times [2019-10-13 21:29:48,744 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:48,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697125551] [2019-10-13 21:29:48,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:48,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:48,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:48,832 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:29:48,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697125551] [2019-10-13 21:29:48,832 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:48,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:48,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498932404] [2019-10-13 21:29:48,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:48,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:48,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:48,834 INFO L87 Difference]: Start difference. First operand 292 states and 409 transitions. Second operand 5 states. [2019-10-13 21:29:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:49,372 INFO L93 Difference]: Finished difference Result 615 states and 884 transitions. [2019-10-13 21:29:49,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:49,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:49,375 INFO L225 Difference]: With dead ends: 615 [2019-10-13 21:29:49,375 INFO L226 Difference]: Without dead ends: 347 [2019-10-13 21:29:49,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-10-13 21:29:49,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 292. [2019-10-13 21:29:49,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 408 transitions. [2019-10-13 21:29:49,406 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 408 transitions. Word has length 148 [2019-10-13 21:29:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:49,406 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 408 transitions. [2019-10-13 21:29:49,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 408 transitions. [2019-10-13 21:29:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:49,409 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:49,409 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:49,409 INFO L410 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:49,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1130661647, now seen corresponding path program 1 times [2019-10-13 21:29:49,410 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:49,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796253791] [2019-10-13 21:29:49,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:49,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:49,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:49,484 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:29:49,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796253791] [2019-10-13 21:29:49,485 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:49,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:49,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978573792] [2019-10-13 21:29:49,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:49,486 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:49,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:49,487 INFO L87 Difference]: Start difference. First operand 292 states and 408 transitions. Second operand 5 states. [2019-10-13 21:29:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:50,162 INFO L93 Difference]: Finished difference Result 613 states and 878 transitions. [2019-10-13 21:29:50,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:50,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:50,165 INFO L225 Difference]: With dead ends: 613 [2019-10-13 21:29:50,165 INFO L226 Difference]: Without dead ends: 345 [2019-10-13 21:29:50,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-13 21:29:50,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 292. [2019-10-13 21:29:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-13 21:29:50,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 407 transitions. [2019-10-13 21:29:50,193 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 407 transitions. Word has length 148 [2019-10-13 21:29:50,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:50,194 INFO L462 AbstractCegarLoop]: Abstraction has 292 states and 407 transitions. [2019-10-13 21:29:50,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 407 transitions. [2019-10-13 21:29:50,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:50,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:50,196 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:50,197 INFO L410 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:50,197 INFO L82 PathProgramCache]: Analyzing trace with hash 92077073, now seen corresponding path program 1 times [2019-10-13 21:29:50,197 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:50,198 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010832014] [2019-10-13 21:29:50,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:50,198 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:50,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:50,267 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:29:50,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010832014] [2019-10-13 21:29:50,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:50,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:50,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766920092] [2019-10-13 21:29:50,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:50,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:50,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:50,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:50,269 INFO L87 Difference]: Start difference. First operand 292 states and 407 transitions. Second operand 6 states. [2019-10-13 21:29:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:50,330 INFO L93 Difference]: Finished difference Result 584 states and 839 transitions. [2019-10-13 21:29:50,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:50,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-13 21:29:50,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:50,334 INFO L225 Difference]: With dead ends: 584 [2019-10-13 21:29:50,334 INFO L226 Difference]: Without dead ends: 317 [2019-10-13 21:29:50,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-10-13 21:29:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 297. [2019-10-13 21:29:50,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-13 21:29:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 412 transitions. [2019-10-13 21:29:50,368 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 412 transitions. Word has length 148 [2019-10-13 21:29:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:50,369 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 412 transitions. [2019-10-13 21:29:50,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 412 transitions. [2019-10-13 21:29:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:50,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:50,372 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:50,373 INFO L410 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash -964654129, now seen corresponding path program 1 times [2019-10-13 21:29:50,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:50,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632873865] [2019-10-13 21:29:50,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:50,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:50,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:50,463 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:29:50,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632873865] [2019-10-13 21:29:50,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:50,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:50,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315714763] [2019-10-13 21:29:50,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:50,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:50,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:50,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:50,466 INFO L87 Difference]: Start difference. First operand 297 states and 412 transitions. Second operand 4 states. [2019-10-13 21:29:50,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:50,854 INFO L93 Difference]: Finished difference Result 834 states and 1196 transitions. [2019-10-13 21:29:50,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:50,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-13 21:29:50,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:50,858 INFO L225 Difference]: With dead ends: 834 [2019-10-13 21:29:50,859 INFO L226 Difference]: Without dead ends: 562 [2019-10-13 21:29:50,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:29:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-13 21:29:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 556. [2019-10-13 21:29:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-10-13 21:29:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 771 transitions. [2019-10-13 21:29:50,914 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 771 transitions. Word has length 148 [2019-10-13 21:29:50,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:50,915 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 771 transitions. [2019-10-13 21:29:50,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 771 transitions. [2019-10-13 21:29:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:50,917 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:50,918 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:50,918 INFO L410 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:50,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:50,918 INFO L82 PathProgramCache]: Analyzing trace with hash 152530832, now seen corresponding path program 1 times [2019-10-13 21:29:50,919 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:50,919 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724106684] [2019-10-13 21:29:50,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:50,919 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:50,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:50,983 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:29:50,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724106684] [2019-10-13 21:29:50,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:50,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:50,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294589407] [2019-10-13 21:29:50,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:50,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:50,985 INFO L87 Difference]: Start difference. First operand 556 states and 771 transitions. Second operand 6 states. [2019-10-13 21:29:51,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:51,059 INFO L93 Difference]: Finished difference Result 1109 states and 1578 transitions. [2019-10-13 21:29:51,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:51,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-13 21:29:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:51,063 INFO L225 Difference]: With dead ends: 1109 [2019-10-13 21:29:51,063 INFO L226 Difference]: Without dead ends: 578 [2019-10-13 21:29:51,066 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:51,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-13 21:29:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 561. [2019-10-13 21:29:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-13 21:29:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 775 transitions. [2019-10-13 21:29:51,115 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 775 transitions. Word has length 148 [2019-10-13 21:29:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:51,116 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 775 transitions. [2019-10-13 21:29:51,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 775 transitions. [2019-10-13 21:29:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:51,118 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:51,118 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:51,118 INFO L410 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:51,119 INFO L82 PathProgramCache]: Analyzing trace with hash -433745390, now seen corresponding path program 1 times [2019-10-13 21:29:51,119 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:51,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262862415] [2019-10-13 21:29:51,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:51,119 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:51,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:51,199 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:29:51,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262862415] [2019-10-13 21:29:51,201 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:51,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:51,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584282010] [2019-10-13 21:29:51,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:51,203 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:51,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:51,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:51,205 INFO L87 Difference]: Start difference. First operand 561 states and 775 transitions. Second operand 4 states. [2019-10-13 21:29:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:51,647 INFO L93 Difference]: Finished difference Result 1620 states and 2315 transitions. [2019-10-13 21:29:51,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:51,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-13 21:29:51,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:51,655 INFO L225 Difference]: With dead ends: 1620 [2019-10-13 21:29:51,655 INFO L226 Difference]: Without dead ends: 1084 [2019-10-13 21:29:51,659 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:29:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-10-13 21:29:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1076. [2019-10-13 21:29:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-10-13 21:29:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1485 transitions. [2019-10-13 21:29:51,781 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1485 transitions. Word has length 148 [2019-10-13 21:29:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:51,782 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 1485 transitions. [2019-10-13 21:29:51,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1485 transitions. [2019-10-13 21:29:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:51,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:51,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:51,787 INFO L410 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:51,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:51,787 INFO L82 PathProgramCache]: Analyzing trace with hash -888651471, now seen corresponding path program 1 times [2019-10-13 21:29:51,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:51,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976779791] [2019-10-13 21:29:51,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:51,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:51,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:51,915 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:29:51,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976779791] [2019-10-13 21:29:51,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:51,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:51,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830280105] [2019-10-13 21:29:51,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:51,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:51,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:51,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:51,917 INFO L87 Difference]: Start difference. First operand 1076 states and 1485 transitions. Second operand 6 states. [2019-10-13 21:29:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:52,041 INFO L93 Difference]: Finished difference Result 2165 states and 3065 transitions. [2019-10-13 21:29:52,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:52,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-13 21:29:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:52,049 INFO L225 Difference]: With dead ends: 2165 [2019-10-13 21:29:52,049 INFO L226 Difference]: Without dead ends: 1114 [2019-10-13 21:29:52,054 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:52,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2019-10-13 21:29:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1086. [2019-10-13 21:29:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-10-13 21:29:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1493 transitions. [2019-10-13 21:29:52,171 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1493 transitions. Word has length 148 [2019-10-13 21:29:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:52,172 INFO L462 AbstractCegarLoop]: Abstraction has 1086 states and 1493 transitions. [2019-10-13 21:29:52,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1493 transitions. [2019-10-13 21:29:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:52,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:52,177 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:52,177 INFO L410 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:52,178 INFO L82 PathProgramCache]: Analyzing trace with hash -49617809, now seen corresponding path program 1 times [2019-10-13 21:29:52,178 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:52,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398737490] [2019-10-13 21:29:52,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:52,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:52,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:52,271 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:29:52,272 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398737490] [2019-10-13 21:29:52,272 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:52,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:52,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756866727] [2019-10-13 21:29:52,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:52,274 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:52,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:52,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:52,275 INFO L87 Difference]: Start difference. First operand 1086 states and 1493 transitions. Second operand 4 states. [2019-10-13 21:29:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:52,796 INFO L93 Difference]: Finished difference Result 3183 states and 4531 transitions. [2019-10-13 21:29:52,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:52,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-13 21:29:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:52,810 INFO L225 Difference]: With dead ends: 3183 [2019-10-13 21:29:52,811 INFO L226 Difference]: Without dead ends: 2122 [2019-10-13 21:29:52,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:29:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-10-13 21:29:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2110. [2019-10-13 21:29:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-10-13 21:29:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 2899 transitions. [2019-10-13 21:29:53,037 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 2899 transitions. Word has length 148 [2019-10-13 21:29:53,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:53,037 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 2899 transitions. [2019-10-13 21:29:53,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2899 transitions. [2019-10-13 21:29:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:53,039 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:53,040 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:53,040 INFO L410 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:53,041 INFO L82 PathProgramCache]: Analyzing trace with hash 91481712, now seen corresponding path program 1 times [2019-10-13 21:29:53,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:53,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986751468] [2019-10-13 21:29:53,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:53,041 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:53,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:53,116 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:29:53,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986751468] [2019-10-13 21:29:53,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:53,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:53,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551415365] [2019-10-13 21:29:53,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:53,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:53,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:53,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:53,120 INFO L87 Difference]: Start difference. First operand 2110 states and 2899 transitions. Second operand 6 states. [2019-10-13 21:29:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:53,320 INFO L93 Difference]: Finished difference Result 4259 states and 6003 transitions. [2019-10-13 21:29:53,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:53,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-13 21:29:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:53,339 INFO L225 Difference]: With dead ends: 4259 [2019-10-13 21:29:53,339 INFO L226 Difference]: Without dead ends: 2174 [2019-10-13 21:29:53,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-10-13 21:29:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2130. [2019-10-13 21:29:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-10-13 21:29:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2915 transitions. [2019-10-13 21:29:53,529 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2915 transitions. Word has length 148 [2019-10-13 21:29:53,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:53,530 INFO L462 AbstractCegarLoop]: Abstraction has 2130 states and 2915 transitions. [2019-10-13 21:29:53,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2915 transitions. [2019-10-13 21:29:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:53,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:53,532 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:53,532 INFO L410 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:53,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:53,533 INFO L82 PathProgramCache]: Analyzing trace with hash -401144462, now seen corresponding path program 1 times [2019-10-13 21:29:53,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:53,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948622156] [2019-10-13 21:29:53,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:53,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:53,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:53,607 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:29:53,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948622156] [2019-10-13 21:29:53,608 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:53,608 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:53,608 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122015567] [2019-10-13 21:29:53,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:53,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:53,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:53,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:53,610 INFO L87 Difference]: Start difference. First operand 2130 states and 2915 transitions. Second operand 6 states. [2019-10-13 21:29:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:53,851 INFO L93 Difference]: Finished difference Result 4339 states and 6096 transitions. [2019-10-13 21:29:53,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:53,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-13 21:29:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:53,865 INFO L225 Difference]: With dead ends: 4339 [2019-10-13 21:29:53,866 INFO L226 Difference]: Without dead ends: 2234 [2019-10-13 21:29:53,875 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-10-13 21:29:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2170. [2019-10-13 21:29:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-13 21:29:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2955 transitions. [2019-10-13 21:29:54,049 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2955 transitions. Word has length 148 [2019-10-13 21:29:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:54,050 INFO L462 AbstractCegarLoop]: Abstraction has 2170 states and 2955 transitions. [2019-10-13 21:29:54,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2955 transitions. [2019-10-13 21:29:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:54,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:54,052 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:54,053 INFO L410 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:54,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:54,053 INFO L82 PathProgramCache]: Analyzing trace with hash -199320528, now seen corresponding path program 1 times [2019-10-13 21:29:54,053 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:54,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386139909] [2019-10-13 21:29:54,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:54,054 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:54,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:54,122 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:29:54,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386139909] [2019-10-13 21:29:54,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:54,123 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:54,123 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455442758] [2019-10-13 21:29:54,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:54,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:54,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:54,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:54,128 INFO L87 Difference]: Start difference. First operand 2170 states and 2955 transitions. Second operand 6 states. [2019-10-13 21:29:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:54,302 INFO L93 Difference]: Finished difference Result 4395 states and 6136 transitions. [2019-10-13 21:29:54,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:54,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-13 21:29:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:54,316 INFO L225 Difference]: With dead ends: 4395 [2019-10-13 21:29:54,316 INFO L226 Difference]: Without dead ends: 2250 [2019-10-13 21:29:54,325 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:54,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-10-13 21:29:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2210. [2019-10-13 21:29:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2210 states. [2019-10-13 21:29:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 2995 transitions. [2019-10-13 21:29:54,566 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 2995 transitions. Word has length 148 [2019-10-13 21:29:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:54,567 INFO L462 AbstractCegarLoop]: Abstraction has 2210 states and 2995 transitions. [2019-10-13 21:29:54,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2995 transitions. [2019-10-13 21:29:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:54,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:54,568 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:54,569 INFO L410 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:54,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:54,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2067060658, now seen corresponding path program 1 times [2019-10-13 21:29:54,569 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:54,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879576182] [2019-10-13 21:29:54,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:54,570 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:54,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:54,655 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:29:54,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879576182] [2019-10-13 21:29:54,656 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:54,656 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:29:54,656 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103875346] [2019-10-13 21:29:54,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:29:54,657 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:54,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:29:54,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:29:54,658 INFO L87 Difference]: Start difference. First operand 2210 states and 2995 transitions. Second operand 4 states. [2019-10-13 21:29:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:55,219 INFO L93 Difference]: Finished difference Result 6531 states and 9171 transitions. [2019-10-13 21:29:55,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:29:55,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-13 21:29:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:55,244 INFO L225 Difference]: With dead ends: 6531 [2019-10-13 21:29:55,244 INFO L226 Difference]: Without dead ends: 4346 [2019-10-13 21:29:55,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:29:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-10-13 21:29:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4326. [2019-10-13 21:29:55,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4326 states. [2019-10-13 21:29:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 5865 transitions. [2019-10-13 21:29:55,710 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 5865 transitions. Word has length 148 [2019-10-13 21:29:55,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:55,711 INFO L462 AbstractCegarLoop]: Abstraction has 4326 states and 5865 transitions. [2019-10-13 21:29:55,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:29:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 5865 transitions. [2019-10-13 21:29:55,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:55,712 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:55,712 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:55,713 INFO L410 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:55,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:55,713 INFO L82 PathProgramCache]: Analyzing trace with hash -795071919, now seen corresponding path program 1 times [2019-10-13 21:29:55,713 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:55,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702433479] [2019-10-13 21:29:55,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:55,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:55,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:55,799 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:29:55,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702433479] [2019-10-13 21:29:55,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:55,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:29:55,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503926963] [2019-10-13 21:29:55,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:29:55,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:55,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:29:55,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:55,804 INFO L87 Difference]: Start difference. First operand 4326 states and 5865 transitions. Second operand 6 states. [2019-10-13 21:29:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:56,175 INFO L93 Difference]: Finished difference Result 8683 states and 12065 transitions. [2019-10-13 21:29:56,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:56,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-13 21:29:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:56,213 INFO L225 Difference]: With dead ends: 8683 [2019-10-13 21:29:56,213 INFO L226 Difference]: Without dead ends: 4382 [2019-10-13 21:29:56,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:29:56,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2019-10-13 21:29:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4366. [2019-10-13 21:29:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4366 states. [2019-10-13 21:29:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4366 states to 4366 states and 5897 transitions. [2019-10-13 21:29:56,621 INFO L78 Accepts]: Start accepts. Automaton has 4366 states and 5897 transitions. Word has length 148 [2019-10-13 21:29:56,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:56,621 INFO L462 AbstractCegarLoop]: Abstraction has 4366 states and 5897 transitions. [2019-10-13 21:29:56,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:29:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4366 states and 5897 transitions. [2019-10-13 21:29:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:56,623 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:56,623 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:56,623 INFO L410 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:56,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash -546925425, now seen corresponding path program 1 times [2019-10-13 21:29:56,624 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:56,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017604744] [2019-10-13 21:29:56,624 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:56,625 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:56,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:56,708 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:29:56,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017604744] [2019-10-13 21:29:56,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:56,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:56,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202462262] [2019-10-13 21:29:56,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:56,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:56,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:56,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:56,712 INFO L87 Difference]: Start difference. First operand 4366 states and 5897 transitions. Second operand 5 states. [2019-10-13 21:29:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:57,863 INFO L93 Difference]: Finished difference Result 10738 states and 14431 transitions. [2019-10-13 21:29:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:29:57,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:57,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:57,893 INFO L225 Difference]: With dead ends: 10738 [2019-10-13 21:29:57,893 INFO L226 Difference]: Without dead ends: 6398 [2019-10-13 21:29:57,908 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 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:29:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6398 states. [2019-10-13 21:29:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6398 to 5902. [2019-10-13 21:29:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5902 states. [2019-10-13 21:29:58,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 7609 transitions. [2019-10-13 21:29:58,384 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 7609 transitions. Word has length 148 [2019-10-13 21:29:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:58,384 INFO L462 AbstractCegarLoop]: Abstraction has 5902 states and 7609 transitions. [2019-10-13 21:29:58,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:58,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 7609 transitions. [2019-10-13 21:29:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:58,386 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:58,386 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:58,386 INFO L410 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:58,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1576284723, now seen corresponding path program 1 times [2019-10-13 21:29:58,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:58,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474895410] [2019-10-13 21:29:58,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:58,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:58,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:29:58,468 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:29:58,469 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474895410] [2019-10-13 21:29:58,469 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:29:58,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:29:58,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098592457] [2019-10-13 21:29:58,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:29:58,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:29:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:29:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:29:58,471 INFO L87 Difference]: Start difference. First operand 5902 states and 7609 transitions. Second operand 5 states. [2019-10-13 21:29:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:29:59,590 INFO L93 Difference]: Finished difference Result 11778 states and 15214 transitions. [2019-10-13 21:29:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:29:59,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:29:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:29:59,614 INFO L225 Difference]: With dead ends: 11778 [2019-10-13 21:29:59,615 INFO L226 Difference]: Without dead ends: 5902 [2019-10-13 21:29:59,632 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:29:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5902 states. [2019-10-13 21:29:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5902 to 5902. [2019-10-13 21:29:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5902 states. [2019-10-13 21:29:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 7577 transitions. [2019-10-13 21:29:59,958 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 7577 transitions. Word has length 148 [2019-10-13 21:29:59,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:29:59,958 INFO L462 AbstractCegarLoop]: Abstraction has 5902 states and 7577 transitions. [2019-10-13 21:29:59,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:29:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 7577 transitions. [2019-10-13 21:29:59,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:29:59,960 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:29:59,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:59,960 INFO L410 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:29:59,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:29:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash -916753201, now seen corresponding path program 1 times [2019-10-13 21:29:59,961 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:29:59,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795737540] [2019-10-13 21:29:59,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:59,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:29:59,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:29:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:00,038 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:30:00,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795737540] [2019-10-13 21:30:00,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:00,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:00,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796043446] [2019-10-13 21:30:00,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:00,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:00,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:00,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:00,041 INFO L87 Difference]: Start difference. First operand 5902 states and 7577 transitions. Second operand 5 states. [2019-10-13 21:30:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:02,626 INFO L93 Difference]: Finished difference Result 14100 states and 18197 transitions. [2019-10-13 21:30:02,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:30:02,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:30:02,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:02,687 INFO L225 Difference]: With dead ends: 14100 [2019-10-13 21:30:02,688 INFO L226 Difference]: Without dead ends: 8224 [2019-10-13 21:30:02,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 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:30:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8224 states. [2019-10-13 21:30:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8224 to 7936. [2019-10-13 21:30:03,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7936 states. [2019-10-13 21:30:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7936 states to 7936 states and 10015 transitions. [2019-10-13 21:30:03,775 INFO L78 Accepts]: Start accepts. Automaton has 7936 states and 10015 transitions. Word has length 148 [2019-10-13 21:30:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:03,777 INFO L462 AbstractCegarLoop]: Abstraction has 7936 states and 10015 transitions. [2019-10-13 21:30:03,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 7936 states and 10015 transitions. [2019-10-13 21:30:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:30:03,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:03,780 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:03,780 INFO L410 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1311119987, now seen corresponding path program 1 times [2019-10-13 21:30:03,781 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:03,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826998724] [2019-10-13 21:30:03,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:03,782 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:03,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:03,898 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:30:03,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826998724] [2019-10-13 21:30:03,899 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:03,899 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:03,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146902942] [2019-10-13 21:30:03,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:03,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:03,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:03,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:03,901 INFO L87 Difference]: Start difference. First operand 7936 states and 10015 transitions. Second operand 5 states. [2019-10-13 21:30:05,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:05,004 INFO L93 Difference]: Finished difference Result 15844 states and 20054 transitions. [2019-10-13 21:30:05,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:05,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:30:05,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:05,033 INFO L225 Difference]: With dead ends: 15844 [2019-10-13 21:30:05,034 INFO L226 Difference]: Without dead ends: 7936 [2019-10-13 21:30:05,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:05,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7936 states. [2019-10-13 21:30:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7936 to 7936. [2019-10-13 21:30:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7936 states. [2019-10-13 21:30:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7936 states to 7936 states and 9967 transitions. [2019-10-13 21:30:05,692 INFO L78 Accepts]: Start accepts. Automaton has 7936 states and 9967 transitions. Word has length 148 [2019-10-13 21:30:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:05,692 INFO L462 AbstractCegarLoop]: Abstraction has 7936 states and 9967 transitions. [2019-10-13 21:30:05,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7936 states and 9967 transitions. [2019-10-13 21:30:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:30:05,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:05,694 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:05,694 INFO L410 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:05,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:05,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2139841807, now seen corresponding path program 1 times [2019-10-13 21:30:05,695 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:05,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177257878] [2019-10-13 21:30:05,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:05,695 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:05,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:05,758 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:30:05,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177257878] [2019-10-13 21:30:05,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:05,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:05,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292795068] [2019-10-13 21:30:05,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:05,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:05,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:05,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:05,761 INFO L87 Difference]: Start difference. First operand 7936 states and 9967 transitions. Second operand 5 states. [2019-10-13 21:30:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:30:06,816 INFO L93 Difference]: Finished difference Result 15844 states and 19958 transitions. [2019-10-13 21:30:06,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:30:06,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 21:30:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:30:06,844 INFO L225 Difference]: With dead ends: 15844 [2019-10-13 21:30:06,844 INFO L226 Difference]: Without dead ends: 7936 [2019-10-13 21:30:06,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:30:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7936 states. [2019-10-13 21:30:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7936 to 7936. [2019-10-13 21:30:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7936 states. [2019-10-13 21:30:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7936 states to 7936 states and 9919 transitions. [2019-10-13 21:30:07,478 INFO L78 Accepts]: Start accepts. Automaton has 7936 states and 9919 transitions. Word has length 148 [2019-10-13 21:30:07,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:30:07,478 INFO L462 AbstractCegarLoop]: Abstraction has 7936 states and 9919 transitions. [2019-10-13 21:30:07,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:30:07,479 INFO L276 IsEmpty]: Start isEmpty. Operand 7936 states and 9919 transitions. [2019-10-13 21:30:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:30:07,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:30:07,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,481 INFO L410 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:30:07,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:30:07,481 INFO L82 PathProgramCache]: Analyzing trace with hash -104141491, now seen corresponding path program 1 times [2019-10-13 21:30:07,481 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:30:07,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443355769] [2019-10-13 21:30:07,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:07,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:30:07,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:30:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:30:07,557 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:30:07,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443355769] [2019-10-13 21:30:07,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:30:07,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:30:07,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274356179] [2019-10-13 21:30:07,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:30:07,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:30:07,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:30:07,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:30:07,559 INFO L87 Difference]: Start difference. First operand 7936 states and 9919 transitions. Second operand 5 states.